發(fā)布時間：2018-04-02 13:32

  本文選題：三維裝箱問題　切入點：動態(tài)裝箱　出處：《東北電力大學》2017年碩士論文

【摘要】：裝箱問題具有廣泛的應用性。在實際應用中,受到裝箱問題影響最直接和顯著的領域是物流運輸行業(yè)。在當今物聯(lián)網(wǎng)、互聯(lián)網(wǎng)+的時代,“人工智能”已經成為一種標志,而物流運輸中裝載工作還是根據(jù)經驗來完成的,這就很難保證貨箱空間利用率和企業(yè)成本問題。三維裝箱問題的研究,對于物流公司提高裝箱空間利用率、減少物流成本意義重大。本文基于三維裝箱問題的實際情況,建立了多貨箱、多貨物及多目的地的三維裝箱問題的整數(shù)規(guī)劃模型;針對貨箱、貨物規(guī)格及目的地單一的三維裝箱問題,設計了相應的基于底層優(yōu)先的動態(tài)裝箱的啟發(fā)式算法,并將研究結果應用于實際三維裝箱問題進行實證研究。首先,構建了三維裝箱問題的整數(shù)規(guī)劃模型。系統(tǒng)地分析了裝箱全過程,考慮了裝箱穩(wěn)定性和平行性等約束,通過引入0-1變量等方法,對約束條件進行數(shù)學描述,構建了貨箱、貨物規(guī)格和目的地單一的三維裝箱問題的整數(shù)規(guī)劃模型。并以此為基礎,分別構建了貨箱規(guī)格和目的地單一、貨物規(guī)格多種的三維裝箱問題的優(yōu)化模型、貨箱規(guī)格單一、貨物規(guī)格和目的地多種的三維裝箱問題的優(yōu)化模型和貨箱、貨物規(guī)格和目的地多種的三維裝箱問題的優(yōu)化模型。然后,相應地設計了貨箱、貨物規(guī)格和目的地單一的三維裝箱問題的基于底層優(yōu)先動態(tài)裝箱的啟發(fā)式算法。三維裝箱問題中貨物裝載時,是按照“由左向右、由下向上”的順序依次裝箱。因此,底層裝箱方案尤為重要,它直接影響到貨箱空間的利用率。本文以裝箱體積最大為目標設計優(yōu)化模型,求得底層最優(yōu)裝箱方案,并以此類推求得剩余空間最優(yōu)裝箱方案,并對裝箱方案進行穩(wěn)定性驗證,對不符合穩(wěn)定性要求的方案進行調整,從而得到整箱最優(yōu)裝箱方案。最后,對本文研究結果進行了實例驗證。將本文建立的整數(shù)規(guī)劃模型應用于乘用車裝載方案,綜合考慮裝載約束,建立模型快速求解,得到了乘用車使用數(shù)量較少的裝載方案;以文獻中的經典算例為例,應用本文設計的啟發(fā)式算法進行求解,并與文獻結果進行比對,驗證了算法的合理性,使得裝箱利用率達到了百分之九十以上。實證研究結果表明,本文構建的整數(shù)規(guī)劃優(yōu)化模型能夠在滿足裝箱全部約束的條件下快速得到合理的方案,設計的啟發(fā)式算法能夠得到較高裝箱空間利用率的裝箱方案。
[Abstract]:Packing problem has wide application. In practical application, the most direct and significant field affected by packing problem is logistics transportation industry. In the age of Internet of things and Internet, "artificial intelligence" has become a symbol. However, the loading work in logistics transportation is completed according to experience, so it is very difficult to ensure the utilization ratio of container space and the cost of enterprises. It is of great significance to reduce the cost of logistics. Based on the actual situation of the three-dimensional packing problem, the integer programming model of the three-dimensional packing problem of multi-container, multi-cargo and multi-destination is established in this paper. This paper designs a heuristic algorithm based on the underlying priority dynamic packing algorithm, and applies the results to the actual three-dimensional packing problem. The integer programming model of 3D packing problem is constructed. The whole process of packing is systematically analyzed, and the constraints such as packing stability and parallelism are considered. By introducing 0-1 variables, the constraint conditions are mathematically described, and the container is constructed. Based on the integer programming model of three-dimensional packing problem with single cargo specification and destination, the optimization model of three-dimensional packing problem with single container specification and single destination and multiple cargo specifications is constructed, and the box specification is single. The optimization model of three dimensional packing problem of goods specification and destination, the optimization model of cargo box, the optimization model of three dimensional packing problem of goods specification and destination, and the corresponding design of cargo box, A heuristic algorithm based on the underlying priority dynamic packing problem for a single three-dimensional packing problem with a single cargo specification and destination. In the 3D packing problem, the loading order is "from left to right, from bottom to top". The bottom packing scheme is especially important, which directly affects the utilization rate of the container space. In this paper, the optimal packing scheme is obtained by using the maximum volume of the container as the objective, and the optimal packing scheme of the remaining space is obtained by analogy. The stability of the packing scheme is verified, and the scheme that does not meet the requirements of stability is adjusted to get the optimal packing scheme for the whole box. Finally, The integer programming model is applied to the loading scheme of passenger vehicle, and the model is solved quickly by considering the loading constraints, and the loading scheme of passenger vehicle is obtained. Taking the classical examples in the literature as an example, the heuristic algorithm designed in this paper is used to solve the problem, and the results are compared with the results in the literature. The rationality of the algorithm is verified, and the case utilization ratio reaches more than 90%. The integer programming optimization model constructed in this paper can quickly obtain a reasonable scheme under the condition of satisfying all packing constraints, and the heuristic algorithm designed can obtain a packing scheme with high packing space utilization ratio.
【學位授予單位】：東北電力大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：O221.4

【參考文獻】

相關期刊論文 前10條

1 王秀宇;;基于非線性規(guī)劃的包裝箱組托優(yōu)化設計[J];包裝工程;2016年19期

2 郭向陽;楊冰峰;張春和;;基于蟻群算法的軍用車輛器材裝箱配載問題[J];包裝工程;2016年11期

3 張雅艦;劉勇;謝松江;;一種求解裝箱問題的改進遺傳算法[J];控制工程;2016年03期

4 王超;金淳;韓慶平;;三維裝載與CVRP聯(lián)合多目標優(yōu)化問題的模型及算法[J];控制與決策;2016年05期

5 劉勝;朱鳳華;呂宜生;李元濤;;求解三維裝箱問題的啟發(fā)式正交二叉樹搜索算法[J];計算機學報;2015年08期

6 江瀑;陳峰;王鈺;;類模式組合裝箱問題模型與精確算法研究[J];工業(yè)工程與管理;2015年01期

7 顏瑞;張群;胡睿;;考慮三維裝箱約束的車輛路徑問題研究[J];中國管理科學;2015年01期

8 何琨;黃文奇;;基于動作空間的三維裝箱問題的確定性高效率求解算法[J];計算機學報;2014年08期

9 張瑩;劉二超;戚銘堯;;考慮支撐面約束的三維裝箱問題快速求解方法[J];交通運輸系統(tǒng)工程與信息;2014年02期

10 孟非;黃太安;解志斌;;一種簡化粒子群算法及在三維裝箱問題中的應用[J];科學技術與工程;2013年31期

，

本文編號：1700634