Journal
JOURNAL OF HEURISTICS
Volume 16, Issue 2, Pages 167-188Publisher
SPRINGER
DOI: 10.1007/s10732-008-9095-x
Keywords
Cutting and packing; Nesting problems; Irregular shape; Beam search
Funding
- UK's Engineering and Physical Sciences Research Council (EPSRC) [GR/S52421/01]
- Engineering and Physical Sciences Research Council [GR/S52421/01] Funding Source: researchfish
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available