This paper presents an integrated approach to the layout generation of 3D rectagonal objects and wiring area estimation. Problems of this type are encountered in various component layout tasks such as the space-efficient placement of electronic components in automobiles. The goal is to achieve high packing densities and fitting of objects in predefined design spaces while satisfying spatial constraints. The layout problem is formulated as mixed integer linear program and can be solved either by a branch&bound procedure or heuristically. The wiring area estimation is integrated in the problem formulation on the basis of a number of explicit wiring variants for each cable.
Issue Section:
Technical Papers
Topics:
Electrical wires
1.
Bischoff, E. E., and Wa¨scher, G., editors, 1995, EJOR; Special Issue on Cutting and Packing, 84, Elsevier.
2.
Lengauer, T., 1990, Combinatorial Algorithms for Integrated Circuit Layout, Applicable Theory in Computer Science, Wiley-Teubner, Chichester-Stuttgart.
3.
Lengauer
, T.
and Mu¨ller
, R.
, 1993
, “Robust and Accurate Hierarchical Floorplanning With Integrated Global Wiring
,” IEEE Trans. Comput.-Aided Des. Integrated Circuits and Systems
,12
, No. 6
, pp. 802
–809
.4.
Kolli, A., Cagan, J., and Rutenbar, R., 1996, “Packing of Generic, Three-Dimensional Components Based on Multi-Resolution Modeling,” Proc. R. Soc. London, Ser. A.
5.
Szykman
, S.
, and Cagan
, J.
, 1997
, “Constrained Three-Dimensional Component Layout Using Simulated Annealing
,” ASME J. Mech. Des.
, 119
, No. 1
, pp. 28
–35
.6.
Cagan
, J.
, Degentesh
, D.
, and Yin
, S.
, 1998
, “A Simulated Annealing-Based Algorithm Using Hierarchical Models for General Three-Dimensional Component Layout
,” Comput.-Aided Des.
, 30
, No. 10
, pp. 781
–790
.7.
Szykman
, S.
, Cagan
, J.
, and Weisser
, P.
, 1998
, “An Integrated Approach to Optimal Three Dimensional Layout and Routing
,” ASME J. Mech. Des.
, 120
, No. 3
, pp. 510
–512
.8.
Scheithauer
, G.
, and Terno
, J.
, 1993
, “Modeling of Packing Problems
,” Optimization
, 28
, pp. 63
–84
.9.
Arnov, B., and Sharir, M., 1994, “On Translational Motion Planning in 3-Space,” Proc. R. Soc. London, Ser. A, pp. 21–30.
10.
Flemming, U., and Woodbury, R. F., 1995, “Software Environment to Support Early Phases in Building Design (SEED): Overview,” ASCE Architectural Engineering, 1 No. 4, pp. 147–152, December.
11.
Landon
, M. D.
, and Balling
, R. J.
, 1994
, “Optimal Packaging of Complex Parametric Solids According to Mass Property Criteria
,” ASME J. Mech. Des.
, 116
, pp. 375
–381
.12.
Sandgren, E., and Dworak, T., 1988, “Part Layout Optimization Using a Quadtree Representation,” in Advances in Design Automation 1988: Proceedings of the 14th ASME Design Automation Conference, pp. 211–219, Kissimmee.
13.
Szykman
, S.
, and Cagan
, J.
, 1996
, “ Synthesis of Optimal Non-Orthogonal Routes
,” ASME J. Mech. Des.
, 118
, No. 3
, pp. 419
–424
.14.
Mitsuta, T., Kobayashi, Y., Wada, Yu., Kiguchi, T., and Yoshinaga, T., 1986, “A Knowledge-Based Approach to Routing Problems in Industrial Plant Design,” Proc. R. Soc. London, Ser. A, pp. 237–256.
15.
Zhu
, D.
, and Latombe
, J.-C.
, 1991
, “Mechanization of Spatial Reasoning for Automatic Pipe Layout Design
,” Artificial Intelligence for Engineering Design, Analysis and Manufacturing
5
, No. 1
, pp. 1
–20
.16.
Burstein, M., and Hong, S. J., 1983, “Hierarchical VLSI Layout: Simultaneous Wiring and Placement,” Proc. R. Soc. London, Ser. A, pp. 45–60.
17.
Yin
, S.
, and Cagan
, J.
, 2000
, “An Extended Pattern Search Algorithm for Three-Dimensional Component Layout
,” J. Mech. Des.
, 122
, No. 1
, pp. 102
–108
.18.
Lengauer, T., and Lu¨gering, M., 1993, “Integer Program Formulations of Global Routing and Placement Problems,” in M. Sarrafzadeh and D.T. Lee, editors, Algorithmic Aspects of VLSI Layout, volume 2 of Lecture Notes Series on Computing, pages 167–197. World Scientific, Singapore.
19.
Chva´tal, V., 1983, Linear Programming. W. H. Freeman and Company, San Francisco.
20.
Fekete, S., and Schepers, J., 1997, “A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems,” Proc. R. Soc. London, Ser. A, pp. 144–156.
21.
Ghosh
, P. K.
, 1990
, “A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations
,” Comput. Vis. Graph. Image Process.
49
, pp. 1
–35
.Copyright © 2001
by ASME
You do not currently have access to this content.
