This paper introduces a simulated annealing-based approach to three-dimensional component packing that employs simulated annealing to generate optimal solutions. Simulated annealing has been used extensively for two-dimensional layout of VLSI circuits; this research extends techniques developed for two-dimensional layout optimization to three-dimensional problems which are more representative of mechanical engineering applications. This research also provides a framework in which to solve general component layout problems.
Issue Section:
Research Papers
1.
Cagan
J.
1994
, “A Shape Annealing Solution to the Constrained Geometric Knapsack Problem
,” Computer-Aided Design
, Vol. 28
, No. 10
, pp. 763
–769
.2.
Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., 1984, “Approximation Algorithms for Bin-Packing—An Updated Survey,” Algorithm Design for Computer System Design, Ausiello, G., M. Lucertini and P. Serafini, eds., Springer-Verlag, New York, pp. 49–106.
3.
Cohn
J. M.
Garrod
D. J.
Rutenbar
R. A.
Carley
L. R.
1991
, “KOAN/ANGRAM II: New Tools for Device-Level Analog Placement and Routing
,” IEEE Journal of Solid-State Circuits
, Vol. 23
, No. 3
, pp. 330
–342
.4.
Corcoran, III, A. L., and Wainwright, R. L., 1992, “A Genetic Algorithm for Packing in Three Dimensions,” Applied Computing: Technological Challenges of the 1990’s—Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing, Kansas City, KS, pp. 1021–1030.
5.
Dowsland
K. A.
Dowsland
W. B.
1992
, “Packing Problems
,” European Journal of Operational Research
, Vol. 56
, pp. 2
–14
.6.
Dyckhoff
H.
1990
, “A Typology of Cutting and Packing Problems
,” European Journal of Operational Research
, Vol. 44
, pp. 145
–159
.7.
Fujita, K., Akagi, S., and Hase, H., 1991, “Hybrid Approach to Plant Layout Design Using Constraint-Directed Search and an Optimization Technique,” Advances in Design Automation 1991: Proceedings of the 17th ASME Design Automation Conference, Vol. 1, Miami, FL, September 22–25, pp. 131–138.
8.
Gursoz
E. L.
Choi
Y.
Prinz
F. B.
1991
, “Boolean Set Operations on Non-Manifold Boundary Representation Objects
,” Computer-Aided Design
, Vol. 23
, No. 1
, pp. 33
–39
.9.
Huang, M. D., Romeo, F., and Sangiovanni-Vincentelli, A., 1986, “An Efficient General Cooling Schedule for Simulated Annealing,” ICCAD-86: IEEE International Conference on Computer-Aided Design—Digest of Technical Papers, Santa Clara, CA, November 11–13, pp. 381–384.
10.
Hustin, S., and Sangiovanni-Vincentelli, A., 1987, “TIM, a New Standard Cell Placement Program Based on the Simulated Annealing Algorithm,” IEEE Physical Design Workshop on Placement and Floorplanning, Hilton Head, SC, April.
11.
Ingber
L.
1993
, “Simulated Annealing: Practice Versus Theory
,” Mathematical and Computer Modelling
, Vol. 18
, No. 11
, pp. 29
–58
.12.
Jajodia
S.
Minis
I.
Harhalakis
G.
Proth
J-M.
1992
, “CLASS: Computerized LAyout Solutions Using Simulated Annealing
,” International Journal of Production Research
, Vol. 30
, No. 1
, pp. 95
–108
.13.
Jepsen, D. W., and Gelatt, Jr., C. D., 1983, “Macro Placement by Monte Carlo Annealing,” Proceedings of the IEEE International Conference on Computer Design, November, pp. 495–498.
14.
Ka¨mpke
T.
1988
, “Simulated Annealing: Use of a New Tool in Bin Packing
,” Annals of Operations Research
, Vol. 16
, pp. 327
–332
.15.
Kawakami, T., Minagawa, M., and Kakazu, Y., 1991, “Auto Tuning of 3-D Packing Rules Using Genetic Algorithms,” Proceedings of the IEEE/RSJ International Workshop on Intelligent Robots and Systems IROS’91, Vol. 3, Osaka, Japan, November 3–5, pp. 1319–1324.
16.
Kim
J. J.
Gossard
D. C.
1991
, “Reasoning on the Location of Components for Assembly Packaging
,” ASME JOURNAL OF MECHANICAL DESIGN
, Vol. 113
, No. 4
, pp. 402
–407
.17.
Kirkpatrick
S.
Gelatt
C. D.
Vecchi
M. P.
1983
, “Optimization by Simulated Annealing
,” Science
, Vol. 220
, No. 4598
, pp. 671
–679
.18.
Landon
M. D.
Balling
R. J.
1994
, “Optimal Packaging of Complex Parametric Solids According to Mass Property Criteria
,” ASME JOURNAL OF MECHANICAL DESIGN
, Vol. 116
, pp. 375
–381
.19.
Lundy
M.
Mees
A.
1986
, “Convergence of an Annealing Algorithm
,” Mathematical Programming
, Vol. 34
, pp. 111
–124
.20.
Sechen, C., 1988, VLSI Placement and Global Routing Using Simulated Annealing, Kluwer Academic Publishers, Boston.
21.
Sechen
C.
Sangiovanni-Vincentelli
A.
1985
, “The TimberWolf Placement and Routing Package
,” IEEE Journal of Solid-State Circuits
, Vol. 20
, No. 2
, pp. 510
–522
.22.
Sherwani, N., 1992, Algorithms for VLSI Physical Design Automation, Kluwer Academic Publishers, Boston.
23.
Szykman, S., and Cagan, J., 1993, “Automated Generation of Optimally Directed Three Dimensional Component Layouts,” Advances in Design Automation 1993: Proceedings of the 19th ASME Design Automation Conference, Vol. 1, Albuquerque, NM, September 19–22, pp. 527–537.
24.
Udy
J. L.
Balling
R. J.
Benzley
S. E.
Landon
M. D.
1988
, “Computation of Interferences Between Three-Dimensional Objects and the Optimal Packing Problem
,” Advances in Engineering Software
, Vol. 10
, No. 1
, pp. 8
–14
.25.
Wong, D. F., Leong, H. W., and Liu, C. L., 1988, Simulated Annealing for VLSI Design, Kluwer Academic Publishers, Boston.
This content is only available via PDF.
Copyright © 1995
by The American Society of Mechanical Engineers
You do not currently have access to this content.
