A fast layer-based heuristic for non-guillotine strip packing
Authors:
- Stephen C.H. LeungSLStephen C.H. Leung
- Defu ZhangDZDefu Zhang
- 1 September 2011
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 38 (10) , 13032-13042
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- One-dimensional heuristics adapted for two-dimensional rectangular strip packingJournal of the Operational Research Society, 2008
- A new heuristic algorithm for rectangle packingComputers & Operations Research, 2007
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problemsEuropean Journal of Operational Research, 2006
- A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapesInternational Transactions in Operational Research, 2003
- An effective quasi-human based heuristic for solving the rectangle packing problemEuropean Journal of Operational Research, 2002
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithmsInternational Journal of Production Research, 1999
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithmJournal of the Operational Research Society, 1997
- Developing a simulated annealing algorithm for the cutting stock problemComputers & Industrial Engineering, 1997
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cutsEuropean Journal of Operational Research, 1995
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987