Automated synthesis of product layout has the potential of substantially reducing design cycle time while allowing for quick check of interference, clearance, scale and fit prior to the building of physical prototypes. The search for optimal positions and orientations of parts in the layout typically requires a huge number of iterations. An extended pattern search layout algorithm based on coordinate search was introduced in an earlier paper and shown quite effective over the previous state-of-the-art. Coordinate search is a simple and straightforward way of implementing the extended pattern search method in the layout problem. However, it is not taking advantage of the wide variety of heuristics admissible in pattern search methods for identifying promising search directions. By introducing various search patterns and exploring their effectiveness in the layout problem, the question of whether complex tactics can do better than the basic coordinate pattern search is addressed. This paper presents four different heuristics for generating pattern directions in the extended pattern search layout algorithm: the conjugate direction method, the modified gradient method, the rank ordering method, and the simplex method. These heuristics are utilized to identify promising search directions and update the set of pattern directions used in the algorithm over iterations. The performance of the different heuristics is compared to that of the basic coordinate extended pattern search layout approach.

1.
De Bont
,
F. M. J.
,
Aarts
,
E. H. L.
,
Meehan
,
P.
, and
O’Brien
,
C. G.
,
1988
, “
Placement of Shapeable Blocks
,”
Philips J. Res.
,
43
, pp.
1
22
.
2.
Sorkin, G., 1992, “Theory and Practice of Simulated Annealing on Special Energy Landscapes,” Ph.D Thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley.
3.
Yin, S., and Cagan, J., 1998, “A Pattern Search-Based Algorithm for Three-Dimensional Component Layout,” Proceedings of the 24th ASME Design Automation Conference (DAC-5582), Atlanta, GA, September 13–16.
4.
Yin
,
S.
, and
Cagan
,
J.
,
2000
, “
An Extended Pattern Search Algorithm for Three-Dimensional Component Layout
,”
ASME J. Mech. Des.
,
122
(
1
), pp.
102
108
.
5.
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.
6.
Hustin, M. D., 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.
7.
Dowsland
,
K. A.
, and
Dowsland
,
W. B.
,
1992
, “
Packing Problems
,”
European Journal of Operational Research
,
56
, pp.
2
14
.
8.
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
.
9.
Kim
,
J. J.
, and
Gossard
,
D. C.
,
1991
, “
Reasoning on the Location of Components for Assembly Packaging
,”
ASME J. Mech. Des.
,
113
, pp.
402
407
.
10.
Wodziack, J., and Fadel, G. M., 1996, “Bi-Objective Optimization of Components Packing Using a Genetic Algorithm,” AIAA-96-4022-CP pp. 352–362, Paper presented at NASA/AIAA/ISSMO Multidisciplinary Design and Optimization Conference, Seattle, WA.
11.
Kirkpatrick
,
S.
,
Gelatt
, Jr.,
C. D.
, and
Vecchi
,
M. P.
,
1983
, “
Optimization by Simulated Annealing
,”
Science
,
220
(
4598
), pp.
671
679
.
12.
Sechen, C., 1988, VLSI Placement and Global Routing Using Simulated Annealing, Kluwer Academic Publishers, Boston.
13.
Wong, D. F., Leong, H. W., and Liu, C. L., 1988, Simulated Annealing for VLSI Design, Kluwer Academic Publishers, Boston.
14.
Szykman
,
S.
, and
Cagan
,
J.
,
1995
, “
A Simulated Annealing Approach to Three-Dimensional Component Packing
,”
ASME J. Mech. Des.
,
117
(
2A
), pp.
308
314
.
15.
Szykman
,
S.
, and
Cagan
,
J.
,
1996
, “
Synthesis of Optimal Non-Orthogonal Routes
,”
ASME J. Mech. Des.
,
118
(
3
), pp.
419
424
.
16.
Szykman
,
S.
, and
Cagan
,
J.
,
1997
, “
Constrained Three Dimensional Component Layout Using Simulated Annealing
,”
ASME J. Mech. Des.
,
119
(
1
), pp.
28
35
.
17.
Szykman
,
S.
,
Cagan
,
J.
, and
Weisser
,
P.
,
1998
, “
An Integrated Approach to Optimal Three Dimensional Layout and Routing
,”
ASME J. Mech. Des.
,
120
(
3
), pp.
510
512
.
18.
Kolli, A., Cagan, J., and Rutenbar, R. A., 1996, “Packing of Generic, Three Dimensional Components Based on Multi-Resolution Modeling,” Proceedings of the 22nd ASME Design Automation Conference (DAC-1479), Irvine, CA, August 19–22.
19.
Smith
,
N.
,
Hills
,
W.
, and
Cleland
,
G.
,
1996
, “
A Layout Design System for Complex Made-to-Order Products
,”
J. Eng. Design
,
7
(
4
), pp.
363
375
.
20.
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
(
10
), pp.
781
790
.
21.
Hooke
,
R.
, and
Jeeves
,
T. A.
,
1961
, “
Direct Search Solution of Numerical and Statistical Problems
,”
J. Assoc. Comput. Mach.
,
8
(
2
), pp.
212
229
.
22.
Torczon, V., and Trosset, M., 1997, “From Evolutionary Operation to Parallel Direct Search: Pattern Search Algorithms for Numerical Optimization,” Computing Science and Statistics, 29.
23.
Powell
,
M. J. D.
,
1963
, “
An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives
,”
Comput. J.
,
7
, pp.
155
162
.
24.
Fletcher
,
R.
, and
Reeves
,
C. M.
,
1964
, “
Function Minimization by Conjugate Gradients
,”
Comput. J.
,
7
(
2
), pp.
149
154
.
25.
Lewis, R. M., and Torczon, V., 1996, “Rank Ordering and Positive Bases in Pattern Search Algorithms,” TR 96-71, ICASE, NASA Langley Research Center, Hampton, VA 23681-0001.
26.
Nelder
,
J. A.
, and
Mead
,
R.
,
1965
, “
A Simplex Method for Function Minimization
,”
Comput. J.
,
7
, pp.
308
313
.
You do not currently have access to this content.