Skip to content

A beam search implementation for the irregular shape packing problem

Research output: Contribution to journalArticlepeer-review

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.
Original languageEnglish
Pages (from-to)167-188
Number of pages22
JournalJournal of Heuristics
Volume16
Issue number2
DOIs
Publication statusPublished - Apr 2010

Related information

Relations Get citation (various referencing formats)

ID: 202720