A beam search implementation for the irregular shape packing problem
Bennell, Julia A. and Song, Xiang (2010) A beam search implementation for the irregular shape packing problem. Journal of Heuristics, 16, (2), 167-188. (doi:10.1007/s10732-008-9095-x).
Full text not available from this repository.
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.
|Digital Object Identifier (DOI):||doi:10.1007/s10732-008-9095-x|
|Keywords:||cutting and packing, nesting problems, irregular shape, beam search|
|Subjects:||H Social Sciences > H Social Sciences (General)|
|Divisions:||University Structure - Pre August 2011 > School of Management
|Date Deposited:||25 May 2010 15:09|
|Last Modified:||31 Mar 2016 13:25|
An Investigation of Cutting/Packing and Planning using Automated Algorithm Selection
Funded by: EPSRC (GR/S52421/01)
April 2004 to August 2007
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)