A beam search implementation for the irregular shape packing problem
- 23 September 2008
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 16 (2) , 167-188
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sumsComputers & Operations Research, 2008
- Complete and robust no-fit polygon generation for the irregular stock cutting problemEuropean Journal of Operational Research, 2007
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing ProblemOperations Research, 2006
- Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop schedulingComputers & Operations Research, 2005
- An algorithm for polygon placement using a bottom-left strategyEuropean Journal of Operational Research, 2002
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithmsComputer-Aided Design, 2001
- Hybridising Tabu Search with Optimisation Techniques for Irregular Stock CuttingManagement Science, 2001
- A tabu thresholding implementation for the irregular stock cutting problemInternational Journal of Production Research, 1999
- Jostling for position: local improvement for irregular cutting patternsJournal of the Operational Research Society, 1998
- Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search MethodsIEEE Transactions on Systems, Man, and Cybernetics, 1980