A fast algorithm for two-dimensional pallet loading problems of large size |
| |
| Affiliation: | 1. Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, PR China;2. Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Hong Kong;3. Zhuoyue Honors College, Hangzhou Dianzi University, Hangzhou 310018, PR China;1. Department of Industrial and Management Engineering, Pohang University of Science and Technology, 77 Cheongam-Ro, Nam-Gu, Pohang 37673, South Korea;2. Department of Information, Operations and Management Science, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012, USA |
| |
| Abstract: | This paper concerns the two-dimensional pallet loading problem (PLP), which requires the determination of the orthogonal layout that loads the maximum number of identical small rectangles (i.e., boxes or products) onto a large rectangle (i.e., pallet or container) without overlapping. Although many algorithms have been developed for this problem, the large amount of time required to find efficient layouts for a large PLP presents great practical difficulties. In this paper, we develop a heuristic that finds efficient layouts with low complexity. We also propose a new algorithm, using the heuristic as a sub-algorithm, which rapidly finds complicated solutions having a 5-block structure. Finally, computational results show that the new algorithm can be successfully applied to large PLPs with sizes exceeding 6800 boxes. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
