Heuristic Approaches for Solving Two-dimensional Packing Problems 趙楷、吳泰熙
E-mail: 9423704@mail.dyu.edu.tw
ABSTRACT
Two-dimensional packing and cutting problems are a kind of common tasks encountered by industries, such as shoes making, textile, steel, clothing, etc. Although the cost of each industrial material is not the same, its cost occupies sizable proportion in the total cost.
Therefore, finding an effective permutation method becomes one of the most important goals of them. In this study, we propose a simulated annealing (SA) based algorithm - IBH2, revised from the IBH algorithm appeared in the open literature for packing rectangle boxes with different sizes in material plates. IBH2 was developed using the placement policy of IBH, while adopting a new SA mechanism allowing the temperature increasing during the annealing process. In addition, we entered the concept of parallel processing and proposed a parallel simulated annealing (PSA). The performance of IBH2 and PSA were verified by running several benchmarking problems and the results were reported. Experimental results indicate that IBH2 and PSA are capable to offer robust and efficient solutions.
Keywords : packing problems, simulated annealing, parallel processing Table of Contents
封面內頁 簽名頁 授權書...iii 中文摘要... v ABSTRACT ... vi 誌謝...vii 目
錄...viii 圖目錄... xi 表目
錄...xii 第一章 緒論... 1 1.1 研究背景與動 機... 1 1.2 研究目的... 2 1.3 研究假設與限
制... 2 1.4 研究方法與架構... 3 第二章 文獻探
討... 5 2.1 二維物件排列問題之相關研究... 5 2.2 模擬退火法於二維 物件排列問題上之相關研究... 10 2.3 平行模擬退火法之相關研究... 11 2.3.1 分工演算 法... 12 2.3.2 叢集演算法... 13 2.3.3 平行模擬退火法的改 進... 15 第三章 二維物件排列問題之求解法... 17 3.1 問題定
義... 17 3.2 模擬退火法... 17 3.2.1 起始 解... 19 3.2.2 使用率... 19 3.2.3 移步法 則... 20 3.2.4 降溫程序... 21 3.2.5 終止條
件... 23 3.3 平行運算... 24 3.3.1 平行運算環境介 紹... 24 3.3.2 平行程式發展環境... 25 3.3.3 平行程式效率之衡 量... 26 3.4 平行模擬退火法... 27 第四章 演算結果與分 析... 31 4.1 文獻例題介紹... 31 4.2 實驗參數分 析... 33 4.2.1 IBH2 參數分析... 34 4.2.2 PSA 參數分 析... 37 4.3 執行結果與分析... 39 4.3.1 IBH2 執行結果與分 析... 39 4.3.2 PSA 執行結果與分析... 43 第五章 結
論... 53 5.1 結論... 53 5.2 建 議... 54 參考文獻... 55 附 錄... 60
REFERENCES
[1] 張幼蘭，「動態平行模擬退火法」，清華大學工業工程學系碩士班碩士論文，2002。
[2] 田邦廷，「長方體物件排列問題解法之研究」，大葉大學工業工程學系碩士班碩士論文，2002。
[3] 陳瑋昶，「平行模擬退火法之改進」，清華大學工業工程學系碩士班碩士論文，2003。
[4] 陳其揚，「使用平行模擬退火演算法於功能性核磁共振造影影像分析之研究」，大葉大學工業工 程學系碩士班碩士論文，2004。
[5] 吳泰熙、駱景堯、林東養，「多尺寸方形排列問題啟發式解法之研究」，工業工程學刊，第17 卷 ，75-85，2000。
[6] 鄭守成，「MPI 平行計算程式設計」，國家高速電腦中心，2001。
[7] Aarts, E., Bont, J., and Laarhoven, P. “Parallel implementations of the statistical cooling algorithm,” Integration, 4, pp.209-238 (1986).
[8] Aarts, E. and Korst, J. “Simulated annealing and boltzmann machines,” Wisely, New York, USA, (1989).
[9] Azencott, “Simulated Annealing:Parallelization Techniques,” Wisely, (1992).
[10] Babu, A.R. and R. Babu, “Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms,”
International Journal of the Production Research, 37, pp.1625-1643 (1999).
[11] Beasley, J. E., “Algorithms for unconstrained two-dimensional guillotine cutting,” Journal of the Operational Research Society, 36, 297-306 (1985).
[12] Biro, M. and E. Borors, “Network flows and non-guillotine cutting patterns,” European Journal of Operational Research, 16, pp.215-221 (1984).
[13] Chen, C. S., S. Sarin, and B. Ram, “The pallet packing for non-uniform box sizes,” International Journal of Production Research Society, 29, 1963-1968 (1991).
[14] Christofides, N. and C. Whitlock, “An algorithm for two dimensional cutting problems,” Operationsl Research, 25, 30-44 (1977).
[15] Dagli, C. H. and A. Hajakbari, “Simulated annealing approach for solving stock cutting problem,” IEEE Transactions on Systems, Man, and Cybernetics, pp.221-223 (1990).
[16] Dagli, C. H. and M. Y. Tatoglu, “An approach to twodimensional cutting stock problem,” International Journal Production Research, 25, pp.175-190 (1987).
[17] Dowsland, K. A. and W. Dowsland, “Packing problem,” European Journal of Operational Research, 56, 2-14 (1992).
[18] Dowsland, K. A. “Some experiments with simulated annealing techniques for packing problems,” European Journal of Operational Research, 68, 389-399 (1993).
[19] Gilmore, P. C. and R. E. Gomory, “A linear programming approach to the cutting stock problem (Part 1),” Operations Research, 9, 849-855 (1961).
[20] Gilmore, P. C. and R. E. Gomory, “A linear programming approach to the cutting stock problem (Part 2),” Operations Research, 11, 863-888 (1963).
[21] Gilmore, P. C. and R. E. Gomory, “A linear programming approach to the cutting stock problem (Part 2),” Operations Research, 11, 863-888 (1963).
[22] Goulimis, C., “Optimal solution for the cutting stock problem,” European Journal of Operational Research, 44, 197-208 (1990).
[23] Hopper, E. and B. C. H. Turton, “An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem,”
European Journal of Operational Research, 128, pp34-57, (2001).
[24] Ismail, H. S. and K. K. B. Hon, “The nesting of 2-dimensional shapes using genetic algorithm,” Proceedings of the Institution of Mechanical Engineers Part B-Journal of Engineering Manufacture, 209, 115-124 (1995).
[25] Jakobs, S., “On genetic algorithms for the packing of polygons,” European Journal of Operational Research, 88, pp165-181 (1996) [26]
Kirkpatrick, S., C. D. Gelatt. Tr., and M.P. Vecchi,“Optimization by simulated annealing,” Sci., 22, 671-680 (1983).
[27] Lai K. K. and J. W. M. Chan, “Developing a simulated annealing algorithm for the cutting stock problem,” Computers ind. Engng., 32, No.1, pp.115-127 (1997).
[28] Leung T.W. , C. H. Yung, and D. M. Troutt, “Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem,” Computer and Industrial Engineering, 40, pp.201-214 (2001).
[29] Leung T.W. , C. K. Chan, and D. M. Troutt, “Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem,” European Journal of Operational Research, 145, pp.530–542 (2003).
[30] Nader, N. and Z. Saeed, “Adaptive temperature control for simulated annealing: a comparative study,” Computers & Operations Research, 31, 2439-2451 (2004).
[31] Pacheco, P. S., “Parallel Programming With MPI,” University of San Franciso, (1995).
[32] Ram, D. J., T. H. Sreenivas. and K. G. Subramaniam, “Parallel simulated annealing algorithm,” Journal of Parallel and Distributed Computing , 37, pp.207-212 (1996).
[33] Wu, T. H., J. F. Chen, C. Y. Low, and P. T. Tang, “Nesting of two-dimensional parts in multiple plates using hybrid algorithm,”
International Journal of the Production Research, 41, 3883-3900 (2003).
[34] Yu G. S. and V. N. Patsuk, “A method of optimal lattice packing of congruent oriented polygons in the plane,” European Journal of Operational Research, 124, 204-216 (2000).
