Journal of Heuristics

, Volume 16, Issue 2, pp 167–188

A beam search implementation for the irregular shape packing problem

Article

DOI: 10.1007/s10732-008-9095-x

Cite this article as:
Bennell, J.A. & Song, X. J Heuristics (2010) 16: 167. doi:10.1007/s10732-008-9095-x

Abstract

This paper investigates the irregular shape packing problem. We represent the problem as an ordered list of pieces to be packed where the order is decoded by a placement heuristic. A placement heuristic from the literature is presented and modified with a more powerful nofit polygon generator and new evaluation criteria. We implement a beam search algorithm to search over the packing order. Using this approach many parallel partial solutions can be generated and compared. Computational results for benchmark problems show that the algorithm generates highly competitive solutions in significantly less time than the best results currently in the literature.

Keywords

Cutting and packing Nesting problems Irregular shape Beam search 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.School of ManagementUniversity of SouthamptonSouthamptonUK