An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure
- Title
- An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure
- Author
- 안선응
- Keywords
- Packing; Combinatorial optimization; Pallet loading problem; Branch and bound; 2-DIMENSIONAL CUTTING PROBLEMS; PACKING PROBLEM
- Issue Date
- 2015-11
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Citation
- EXPERT SYSTEMS WITH APPLICATIONS, v. 42, No. 21, Page. 7676-7683
- Abstract
- This study concerns the pallet-loading problem (PLP), which requires maximizing the number of identical boxes loaded on a large rectangular pallet. The proposed algorithm generates layouts of a specific structure, known as the staircase structure that is very efficient due to its geometrical properties for removing unnecessary patterns and obtaining upper and lower bounds corresponding to the patterns. Efficient methods to remove the dominated and duplicated patterns in the staircase structure are proposed. We then apply these methods to the best-first branch and bound algorithm. Computational results demonstrated the superiority of the proposed algorithm compared with other existing exact algorithms. (C) 2015 Elsevier Ltd. All rights reserved.
- URI
- https://www.sciencedirect.com/science/article/pii/S0957417415003814http://hdl.handle.net/20.500.11754/41004
- ISSN
- 0957-4174; 1873-6793
- DOI
- 10.1016/j.eswa.2015.05.045
- 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