The Two-Dimensional Packing Problem for Irregular Objects
Packing and cutting problems arise in a wide variety of industrial situations. The basic problem is that of determining a good arrangement of objects in a region without any overlap. Much research has been done on two and three dimensional rectangular packing while there has been little work done on irregular packing. In this work, we study the two-dimensional irregular packing problem and provide heuristic solutions which use rectilinear and piecewise-linear representations of objects. These heuristics include Genetic Algorithms and Tabu Search. Experimentation gives good results.
Packing, cutting, irregular objects, meta-heuristics, heuristics
Operations and Supply Chain Management
International Journal on Artificial Intelligence Tools
CHEN, Ping; FU, Zhaohui; LIM, Andrew; and RODRIGUES, Brian.
The Two-Dimensional Packing Problem for Irregular Objects. (2004). International Journal on Artificial Intelligence Tools. 13, (3), 429-448. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2457