A survey of computational approaches to three-dimensional layout problems

The component layout or packaging problem requires efficient search of large, discontinuous spaces. This survey paper reviews the state-of-the-art in product layout algorithms. The focus on optimization and geometric interference calculation strategies addresses the common aspects of the layout problem for all applications.

[1]  G. Stiny.  Introduction to Shape and Shape Grammars , 1980 .

[2]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[3]  Simon Szykman,et al.  Constrained Three-Dimensional Component Layout Using Simulated Annealing , 1997 .

[4]  Anup Kumar,et al.  A Genetic Algorithm for Packing Three-Dimensional Non-Convex Objects Having Cavities and Holes , 1997, ICGA.

[5]  George Harhalakis,et al.  CLASS: Computerized LAyout Solutions using Simulated annealing , 1992 .

[6]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[7]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[8]  Jonathan Cagan,et al.  A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout , 1998, Comput. Aided Des..

[9]  J. Cagan,et al.  An Extended Pattern Search Algorithm for Three-Dimensional Component Layout , 2000 .

[10]  Simon Szykman,et al.  An Integrated Approach to Optimal Three Dimensional Layout and Routing , 1998 .

[11]  Heinz-Otto Peitgen,et al.  The science of fractal images , 2011 .

[12]  Sarosh N. Talukdar,et al.  Insects, fish and computer-based super-agents , 1995 .

[13]  Oliver Vornberger,et al.  An Adaptive Parallel Genetic Algorithm for VLSI-Layout Optimization , 1996, PPSN.

[14]  W. Dowsland.  Three-dimensional packing—solution approaches and heuristic development , 1991 .

[15]  John A. Goldak,et al.  Constructing discrete medial axis of 3-D objects , 1991, Int. J. Comput. Geom. Appl..

[16]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[17]  Virginia Torczon,et al.  PDS: Direct Search Methods for Unconstrained Optimization on Either Sequential or Parallel Machines , 1992 .

[18]  Bruce G. Baumgart,et al.  Geometric modeling for computer vision. , 1974 .

[19]  P. Meehan,et al.  PLACEMENT OF SHAPEABLE BLOCKS , 1988 .

[20]  Eberhard E. Bischoff,et al.  A comparative evaluation of heuristics for container loading , 1990 .

[21]  G. Sorkin.  Theory and practice of simulated annealing on special energy landscapes , 1992 .

[22]  Richard L. Grimsdale,et al.  Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.

[23]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[24]  David C. Gossard,et al.  Reasoning on the Location of Components for Assembly Packaging , 1991 .

[25]  Mark J. Jakiela,et al.  Solving Pattern Nesting Problems with Genetic Algorithms Employing Task Decomposition and Contact Detection , 1995, Evolutionary Computation.

[26]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[27]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[28]  Antonio Albano,et al.  NESTING TWO-DIMENSIONAL SHAPES IN RECTANGULAR MODULES , 1976 .

[29]  Jonathan Cagan,et al.  Optimal Three-Dimensional Placement of Heat Generating Electronic Components , 1997 .

[30]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

[31]  William B. Dowsland.  On a Research Bibliography for Cutting and Packing Problems , 1992 .

[32]  Sharat Israni,et al.  Performance testing of rectangular parts-nesting heuristics , 1985 .

[33]  Edward G. Coffman,et al.  Average-case analysis of cutting and packing in two dimensions , 1990 .

[34]  James P. Cohoon,et al.  Genetic Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[35]  Simon Szykman,et al.  Synthesis of Optimal Nonorthogonal Routes , 1996 .

[36]  R. Balling,et al.  Optimal packaging of complex parametric solids according to mass property criteria , 1994 .

[37]  Jonathan Cagan,et al.  A Simulated Annealing-Based Approach to Three-Dimensional Component Packing , 1995 .

[38]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[39]  W. Hills,et al.  A Layout Design System for Complex Made-to-order Products , 1996 .

[40]  J. A. George,et al.  A heuristic for packing boxes into a container , 1980, Comput. Oper. Res..

[41]  Jonathan Cagan,et al.  Exploring the Effectiveness of Various Patterns in an Extended Pattern Search Layout Algorithm , 2004 .

[42]  M. Levas.  OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[43]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[44]  G S C H E I T H A U,et al.  A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY , 1995 .

[45]  Virginia Torczon,et al.  On the Convergence of Pattern Search Algorithms , 1997, SIAM J. Optim..

[46]  V. Torczon,et al.  From Evolutionary Operation to Parallel Direct Search : Pattern Search Algorithms for Numerical Optimization , 1998 .

[47]  Philip M. Hubbard.  Real-Time Collision Detection and Time-Critical Computing , 1995 .

[48]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[49]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[50]  Jonathan Cagan.  Shape annealing solution to the constrained geometric knapsack problem , 1994, Comput. Aided Des..

[51]  M. Meyer,et al.  A computer-based heuristic for packing pooled shipment containers , 1990 .