A Fast Algorithm for Two-Dimensional Pallet Loading Problems of Large Size
- Title
- A Fast Algorithm for Two-Dimensional Pallet Loading Problems of Large Size
- Author
- 강맹규
- Keywords
- Packing; Two-dimensional; Pallet loading; Heuristics
- Issue Date
- 2001-10
- Publisher
- ELSEVIER SCIENCE BV
- Citation
- European Journal of Operational Research, v. 134, issue. 1, page. 193-202
- 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.
- URI
- https://www.sciencedirect.com/science/article/pii/S0377221700002496https://repository.hanyang.ac.kr/handle/20.500.11754/160204
- ISSN
- 0377-2217; 1872-6860
- DOI
- 10.1016/S0377-2217(00)00249-6
- Appears in Collections:
- COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML