本文關(guān)鍵詞：散套裝貨物混合裝載問(wèn)題優(yōu)化算法研究　出處：《大連理工大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 集裝箱配載優(yōu)化 套裝貨物 角件約束 啟發(fā)式算法 物流管理

【摘要】：集裝箱配載優(yōu)化問(wèn)題是集裝箱運(yùn)輸行業(yè)中的關(guān)鍵問(wèn)題,是一種典型的NP-hard問(wèn)題,具有高度復(fù)雜性,尋找一個(gè)有效的解決多約束集裝箱配載優(yōu)化問(wèn)題的方法有重要現(xiàn)實(shí)意義。本文首先對(duì)集裝箱裝載問(wèn)題進(jìn)行簡(jiǎn)單介紹,并總結(jié)了當(dāng)前的研究現(xiàn)狀,在對(duì)傳統(tǒng)的精確算法及基于規(guī)則的啟發(fā)式算法和基于搜索的啟發(fā)式算法分析比較之后,對(duì)帶角件約束的散套裝混合裝載問(wèn)題提出了一種基于貨物塊和空間的構(gòu)造式啟發(fā)式算法。首先選擇一個(gè)當(dāng)前裝載空間,然后按照貨物優(yōu)先級(jí)對(duì)貨物初步排序,并按空間尺寸生成貨物塊,選擇空間利用率最大的貨物塊裝載,并切割空間。另外,針對(duì)角件約束,提出了一種基于空間切割,及“試空間”方法,有效規(guī)避角件,使角件周圍的空間充分利用。針對(duì)套裝約束,提出一種基于“估計(jì)套裝裝載數(shù)”的套裝裝載迭代算法,通過(guò)比較當(dāng)前剩余空間體積和單套貨物體積,估計(jì)裝載套裝數(shù),試裝載估計(jì)套裝數(shù)并不斷調(diào)整直至套裝能夠成套裝載,該算法能保證貨物成套裝載在同一容器或指定的容器內(nèi)。為驗(yàn)證算法的有效性,本文采用120組隨機(jī)算例進(jìn)行測(cè)試,與同類問(wèn)題的算法比較,結(jié)果顯示本文算法在計(jì)算穩(wěn)定性以及計(jì)算時(shí)間方面都比較優(yōu)秀,驗(yàn)證了算法的有效性。此外,對(duì)帶角件約束和套裝約束的實(shí)際問(wèn)題設(shè)計(jì)測(cè)試算例,采用的是國(guó)際標(biāo)準(zhǔn)尺寸的集裝箱和角件數(shù)據(jù),實(shí)驗(yàn)結(jié)果表明本文所提的角件規(guī)避算法以及套裝裝載迭代算法有效,在引入新的約束后,空間利用率會(huì)稍微有所下降但是仍維持在較高的水平,計(jì)算時(shí)間上會(huì)有所增加,但仍在可接受的范圍內(nèi)。
[Abstract]:Container stowage optimization is a key problem in container transportation industry. It is a typical NP-hard problem with high complexity. It is of great practical significance to find an effective method to solve the problem of multi-constraint container stowage optimization. Firstly, this paper briefly introduces the container loading problem, and summarizes the current research situation. After analyzing and comparing the traditional exact algorithm and the rule-based heuristic algorithm and the search-based heuristic algorithm. In this paper, a constructive heuristic algorithm based on cargo block and space is proposed to solve the mixed loading problem of bulk packages with corner constraint. Firstly, a current loading space is selected, and then the goods are preliminarily sorted according to the priority of the goods. The cargo blocks are generated according to the space size, and the cargo blocks with the highest space utilization are selected to load and cut the space. In addition, a method based on spatial cutting and "test space" is proposed for the constraint of corner parts. In order to avoid corner parts effectively and make full use of the space around corner parts, a set loading iterative algorithm based on "estimating the number of loads" is proposed for suit constraints. By comparing the current volume of the remaining space with the volume of a single set of goods, estimate the number of loads, try to load the number of sets and adjust them until the package can be loaded in a complete set. In order to verify the validity of the algorithm, 120 sets of random examples are used to test and compare with similar algorithms. The results show that the algorithm is very good in terms of computational stability and computation time, which verifies the effectiveness of the algorithm. In addition, a test example is designed for practical problems with angular and set constraints. The data of containers and corner parts of international standard size are used. The experimental results show that the corner circumvention algorithm proposed in this paper and the iterative algorithm of package loading are effective, after introducing new constraints. There will be a slight decline in space utilization but it will remain at a high level, and the computing time will increase, but within acceptable limits.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U169.6

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 李學(xué)工;論物流產(chǎn)業(yè)對(duì)國(guó)民經(jīng)濟(jì)的貢獻(xiàn)[J];北京工商大學(xué)學(xué)報(bào)(社會(huì)科學(xué)版);2003年06期

2 楊玉麗;崔耀東;景運(yùn)革;張青鳳;;生成矩形毛坯最優(yōu)三塊排樣方式的精確算法[J];機(jī)械設(shè)計(jì)與制造;2008年09期

3 張德富;魏麗軍;陳青山;陳火旺;;三維裝箱問(wèn)題的組合啟發(fā)式算法[J];軟件學(xué)報(bào);2007年09期

，

本文編號(hào)：1440360