Generalized pattern search (GPS) algorithms have been used successfully to solve three-dimensional (3D) component layout problems. These algorithms use a set of patterns and successively decreasing step sizes of these patterns to explore the search space before converging to good local minima. A shortcoming of conventional GPS algorithms is the lack of recognition of the fact that patterns affect the objective function by different amounts and hence it might be efficient to introduce them into the search in a certain order rather than introduce all of them at the beginning of the search. To address this shortcoming, it has been shown by the authors in previous work that it is more efficient to schedule patterns in decreasing order of their effect on the objective function. The effect of the patterns on the objective function was estimated by the a priori expectation of the objective function change due to the patterns. However, computing the a priori expectation is expensive, and to practically implement the scheduling of patterns, an inexpensive estimate of the effect on the objective function is necessary. This paper introduces a metric for geometric layout called the sensitivity metric that is computationally inexpensive, to estimate the effect of pattern moves on the objective function. A new pattern search algorithm that uses the sensitivity metric to schedule patterns is shown to perform as well as the pattern search algorithm that used the a priori expectation of the objective function change. Though the sensitivity metric applies to the class of geometric layout or placement problems, the foundation and approach is useful for developing metrics for other optimization problems.

1.
Yin
,
S.
, 2000,
A Computational Framework for Automated Product Layout Synthesis Based on an Extended Pattern Search Algorithm
, Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA.
2.
Yin
,
S.
, and
Cagan
,
J.
, 2000, “
An Extended Pattern Search Algorithm for Three-Dimensional Component Layout
,”
ASME J. Mech. Des.
1050-0472,
122
(
1
), pp.
102
108
.
3.
Ding
,
Q.
, and
Cagan
,
J.
, 2003, “
Automated Trunk Packing with Extended Pattern Search
,”
Proceedings of the 2003 SAE Technical Conferences
,
Detroit, MI
.
4.
Yin
,
S.
,
Cagan
,
J.
, and
Hodges
,
P.
, 2004, “
Layout Optimization of Shapeable Components With Extended Pattern Search Applied to Transmission Design
,”
J. Mech. Des.
1050-0472,
126
(
1
), pp.
188
190
.
5.
Torczon
,
V.
, and
Trosset
,
M.
, 1997, “
From Evolutionary Operation to Parallel Direct Search: Pattern Search Algorithms for Numerical Optimization
,”
Comput. Sci. Statist.
,
29
(
1
), pp.
396
401
.
6.
Aladahalli
,
C.
,
Cagan
,
J.
, and
Shimada
,
K.
, 2007, “
Objective Function Effect Based Pattern Search—Theoretical Framework Inspired by 3D Component Layout
,”
J. Mech. Des.
1050-0472,
129
, March.
7.
Cagan
,
J.
,
Shimada
,
K.
, and
Yin
,
S.
, 2002, “
A Survey of Computational Approaches to Three-Dimensional Layout Problems
,”
CAD
0010-4485,
34
(
8
), pp.
597
611
.
8.
Kawakami
,
T.
,
Minagawa
,
M.
, and
Kakazu
,
Y.
, 1991, “
Auto Tuning of 3-D Packing Rules Using Genetic Algorithms
,” in
Proceedings of the IEEE/RSJ International Workshop on Intelligent Robots and Systems IROS
, Osaka, Japan.
9.
Corcoran
,
A. L.
, III
, 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
.
10.
Wodziack
,
J.
, and
Fadel
,
G. M.
, 1996, “
Bi-Objective Optimization of Components Packing Using Genetic Algorithm
,”
Proceedings NASA/AIAA/ISSMO Multidisciplinary Design and Optimization Conference
,
Seattle, WA
.
11.
Ikonen
,
I.
,
Biles
,
W.
,
Kumar
,
A.
,
Ragade
,
R. K.
, and
Wissel
,
J. C.
, 1997, “
A Genetic Algorithm for Packing Three-Dimensional Non-Convex Objects Having Cavities and Holes
,”
Proceedings of 7th International Conference on Genetic Algorithms
,
Michigan State University, East Lansing, MI
.
12.
Szykman
,
S.
, and
Cagan
,
J.
, 1995, “
A Simulated Annealing Approach to Three-Dimensional Component Packing
,”
ASME J. Mech. Des.
1050-0472,
117
(
2A
), pp.
308
314
.
13.
Szykman
,
S.
, and
Cagan
,
J.
, 1996, “
Synthesis of Optimal Non-Orthogonal Routes
,”
ASME J. Mech. Des.
1050-0472,
118
(
3
), pp.
419
424
.
14.
Szykman
,
S.
, and
Cagan
,
J.
, 1997, “
Constrained Three Dimensional Component Layout Using Simulated Annealing
,”
ASME J. Mech. Des.
1050-0472,
119
(
1
), pp.
28
35
.
15.
Szykman
,
S.
,
Cagan
,
J.
, and
Weisser
,
P.
, 1998, “
An Integrated Approach to Optimal Three Dimensional Layout and Routing
,”
ASME J. Mech. Des.
1050-0472,
120
(
3
), pp.
510
512
.
16.
Dickinson
,
J. K.
, and
Knopf
,
G. K.
, 1998, “
Serial Packing of Arbitrary 3D Objects for Optimizing Layered Manufacturing
,”
Proceedings SPIE Conference on Intelligent Robots and Computer Vision XVII: Algorithms, Techniques, and Active Vision
,
Boston, MA
.
17.
Cagan
,
J.
,
Degentesh
,
D.
, and
Yin
,
S.
, 1998, “
A Simulated Annealing-Based Algorithm Using Hierarchical Models for General Three-Dimensional Component Layout
,”
CAD
0010-4485,
30
(
10
), pp.
781
790
.
18.
Aladahalli
,
C.
,
Cagan
,
J.
, and
Shimada
,
K.
, 2003, “
Minimum Height Packing for Layered Manufacturing Using an Extended Pattern Search Algorithm
,”
Proceedings of the ASME DETC 2003
,
Chicago, IL
.
You do not currently have access to this content.