Article ID: | iaor200969133 |
Country: | United States |
Volume: | 2009 |
Issue: | 150624 |
Start Page Number: | 1 |
End Page Number: | 22 |
Publication Date: | Jul 2009 |
Journal: | Advances in Operations Research |
Authors: | Hifi Mhand, M'Hallah Rym |
Keywords: | heuristics, programming: branch and bound |
This paper reviews the most relevant literature on efficient models and methods for packing circular objects/items into Euclidean plane regions where the objects/items and regions are either two- or three-dimensional. These packing problems are NP hard optimization problems with a wide variety of applications. They have been tackled using various approaches-based algorithms ranging from computer-aided optimality proofs, to branch-and-bound procedures, to constructive approaches, to multi-start nonconvex minimization, to billiard simulation, to multiphase heuristics, and metaheuristics.