Solving Container Loading Problems by Genetic Algorithm 李其憲、吳泰熙
E-mail: 9423686@mail.dyu.edu.tw
ABSTRACT
This paper presents a heuristic methods for solving container loading problem. A ” bottom-back-left ” packing approach with GA is used and .we use parallel machine to solve this problem. It can be solving a best solution in acceptable time. This kind of problems is about container of one size and different size. We will compare result with literature. Container loading problems are frequently using in industries such as manufacturing and logistics. We hope our method can make the operation of this problem well, and save more time.
Keywords : container, loading, genetic algorithms, parallel machine Table of Contents
封面內頁 簽名頁 博碩士論文授權書...iv 中文摘
要...v ABSTRACT...vi 誌 謝... vii 目錄... viii 圖目 錄...xi 表目錄... xii 第一章 緒 論...1 1.1 研究背景與動機...1 1.2 研究目 的...3 1.3 研究假設與限制...3 1.4 研究方法與架 構...4 第二章 文獻探討...6 2.1 長方體物件與長方體容 器...6 2.2 遺傳基因演算法...11 2.3 平行演算
法...12 2.3.1 平行運算的概念與發展...13 2.3.2 平行演算 法...13 2.4 文獻總結...16 第三章 長方體物件堆疊問題求 解...17 3.1 問題定義...17 3.2 物件擺放方向的分
析...17 3.3 遺傳基因演算法(GA)...19 3.3.1 使用
率...20 3.3.2 編碼...21 3.3.3 染色體數與產生母 體...22 3.3.4 育種池...23 3.3.5 交
配...24 3.3.6 突變...26 3.4 第二階段的深度搜 尋...27 3.5 終止條件...28 3.6 遺傳基因演算流
程...28 3.7 平行遺傳基因演算法...31 3.7.1 平行遺傳基因演算法 流程...31 第四章 演算結果與分析...34 4.1 平行遺傳基因演算法實 驗分析...34 4.1.1 遺傳基因演算法實驗參數...34 4.1.2 第二階段演算法之 參數實驗...36 4.2 執行結果與分析...37 4.2.1 單一容器執行結果與分 析...38 4.2.2 多種尺寸容器執行結果與分析...39 4.3 加速因子分
析...40 第五章 結論...42 5.1 結 論...42 5.2 建議...43 參考文 獻...44 附錄...48 REFERENCES
1、 張美忠，「貨物運輸棧板裝載問題啟發式解法之應用」，交通大學士木工程研究所碩士論文， (1992) 2、 黃玟錫，「不規則物件排 列問題解法之研究」，大葉大學工業工程研究所碩士論文，(2001) 3、 徐德興，「利用模擬退火演算法求解不規則物件排列及切割問題
」。大葉大學工業工程研究所 碩士論文，(2000) 4、 田邦廷，長方體物件堆疊問題解法之研究」。大葉大學工業工程研究所碩士論文
，(2002) 5、 Liu, Fuh-hwa F., and Hsiao, C-J., “A three-dimensional pallet loading method for single-size boxes“, Journal of Operational Research Society., 48, 726-735(1997) 6、 Ngoi, B. K. A., Tay, M. L., and Chua, E. S., “Applying spatial representation techniques to the container packing problem”, International Journal of Production Research, 32, 111-123(1994) 7、 Abdou, G., and Yang, M., “A systematic approach for the three-dimensional palletization problem”, International Journal of Production Research, 32, 2381-2394(1994) 8、 Gehring, H., Menschner, K., and Meyer, M., “ A computerbased heuristic for packing pooled shipment containers“, European Journal Operational
Research, 44, 277-288(1990) 9、 George, J. A., and Robinson, D. F., “ A heuristic for packing boxes into a container“, Computers & Operations Research, 7,147-156(1980) 10、 Terno, J., “An efficient approach for the multi-pallet loading problem”, European Journal Operational Research, 123, 372-381(2000) 11、 Scheithauer, G., “LP-based bounds for the container and multi-container loading problem”, International Transactions in Operational Research, 6, 199-213(1999) 12、 Ramesh Babu, A., and Ramesh Babu, N., “Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms”, International Journal of Production Research, 37, 1625-1643(1999) 13、
Gehring, H., and Bortfeld, A., “A genetic algorithm for solving the container loading problem”, International Transactions of Operational Research, 4, 401-418 (1997) 14、 Letchford, A. N., and Amaral, A., ”Analysis of upper bounds for the pallet loading problem”, European Journal Operational Research, 132, 582-593(2001) 15、 Dowsland, K. A., ”A combined data-base and algorithmic approach to the pallet-loading problem”, Journal of the Operational Research Society, 38, 341-345 (1987) 16、 Dowsland, K. A., and Dowsland, W. B., “Packing problem”, European Journal Operational Research, 56, 2-14(1992). 17、 Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., “Optimizaion by simulated annealing”, Sci., 22, 671-680(1983) 18、 Loh, H. T., and Nee, A. Y., “A packing algorithm for hexahedral boxes”, in: Proceedings of the Industrial Automation’92 Conference, Singapore, 115-126(1992) 19、 Bischoff, E. E., Janetz, F., and Ratcliff, M. S. W., “Loading pallets with non-identical items”, European Journal of Operational Research, 84, 681-692(1995) 20、 Bischoff, E. E., and Ratcliff, M. S. W., “Issues in the development of approaches to container loading”, OMEGA, 23/4, 377-390(1995) 21、 Bortfeldt, A., and Gehring, H., “A hybrid genetic algorithm for the container loading problem”, European Journal Operational Research, 131, 143-161(2001) 22、 Eley, M., “Solving container loading problems by block arrangement”, European Journal Operational Research, 141, 393-409(2002) 23、 Chen, C.S., Lee, S.M., and Shen, Q.S., “An analytical model for the container loading problem”, European Journal Operational Research, 80, 68-76(1995) 24、 Xue, J., and Lai, K. K., “Effective methods for a container packing operation”, Mathematical and Computer Modelling , 25, 75-84(1997) 25、 Davies, A. P., and Bischoff, E. E., “Weight distribution considerations in container loading”, European Journal Operational Research, 114, 509-527(1999) 26、
Pisinger, D., “Heuristics for the container loading problem”, European Journal Operational Research, 141, 382-392(2002) 27、 Mauricio, S., Victor, P., and Rodrigo, U., “A parallel genetic algorithm to solve the set-covering problem”, Computers and Operations Research, 29, 1221-1235(2002) 28、 Cochran, J.K., Horng, S.M., and Fowler, J. W., “A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines”, Computers and Operations Research, 30, 1087-1102(2003)
