Insights uncovered by research in design cognition are often utilized to develop methods used by human designers; in this work, such insights are used to inform and improve computational methodologies. This paper introduces the heterogeneous simulated annealing team (HSAT) algorithm, a multiagent simulated annealing (MSA) algorithm. HSAT is based on a validated computational model of human-based engineering design and retains characteristics of the model that structure interaction between team members and allow for heterogeneous search strategies to be employed within a team. The performance of this new algorithm is compared to several other simulated annealing (SA) based algorithms on three carefully selected benchmarking functions. The HSAT algorithm provides terminal solutions that are better on average than other algorithms explored in this work.

References

References
1.
Dinar
,
M.
,
Shah
,
J. J.
,
Cagan
,
J.
,
Leifer
,
L.
,
Linsey
,
J.
,
Smith
,
S. M.
, and
Hernandez
,
N. V.
,
2014
, “
Empirical Studies of Designer Thinking: Past, Present, and Future
,”
ASME J. Mech. Des.
,
137
(
2
), p.
021101
.
2.
Tseng
,
I.
,
Cagan
,
J.
, and
Kotovsky
,
K.
,
2012
, “
Concurrent Optimization of Computationally Learned Stylistic Form and Functional Goals
,”
ASME J. Mech. Des.
,
134
(
11
), p.
111006
.
3.
Goel
,
A. K.
,
Vattam
,
S.
,
Wiltgen
,
B.
, and
Helms
,
M.
,
2012
, “
Cognitive, Collaborative, Conceptual and Creative—Four Characteristics of the Next Generation of Knowledge-Based CAD Systems: A Study in Biologically Inspired Design
,”
Comput. Aided Des.
,
44
(
10
), pp.
879
900
.
4.
Egan
,
P.
,
Cagan
,
J.
,
Schunn
,
C.
, and
LeDuc
,
P. R.
,
2015
, “
Synergistic Human-Agent Methods for Deriving Effective Search Strategies: The Case of Nanoscale Design
,”
Res. Eng. Des.
,
26
(
2
), pp.
145
169
.
5.
McComb
,
C.
,
Cagan
,
J.
, and
Kotovsky
,
K.
,
2015
, “
Lifting the Veil: Drawing Insights About Design Teams From a Cognitively-Inspired Computational Model
,”
Des. Stud.
,
40
, pp.
119
142
.
6.
Cagan
,
J.
, and
Kotovsky
,
K.
,
1997
, “
Simulated Annealing and the Generation of the Objective Function: A Model of Learning During Problem Solving
,”
Comput. Intell.
,
13
(
4
), pp.
534
581
.
7.
Fu
,
K.
,
Cagan
,
J.
, and
Kotovsky
,
K.
,
2010
, “
Design Team Convergence: The Influence of Example Solution Quality
,”
ASME J. Mech. Des.
,
132
(
11
), p.
111005
.
8.
Ball
,
L. J.
, and
Ormerod
,
T. C.
,
1995
, “
Structured and Opportunistic Processing in Design: A Critical Discussion
,”
Int. J. Hum. Comput. Stud.
,
43
(
1
), pp.
131
151
.
9.
McComb
,
C.
,
Cagan
,
J.
, and
Kotovsky
,
K.
,
2015
, “
Rolling With the Punches: An Examination of Team Performance in a Design Task Subject to Drastic Changes
,”
Des. Stud.
,
36
(
1
), pp.
99
121
.
10.
Kirkpatrick
,
S.
,
Gelatt
,
C. D.
, and
Vecchi
,
M. P.
,
1983
, “
Optimization by Simulated Annealing
,”
Science
,
220
(
4598
), pp.
671
680
.
11.
Triki
,
E.
,
Collette
,
Y.
, and
Siarry
,
P.
,
2005
, “
A Theoretical Study on the Behavior of Simulated Annealing Leading to a New Cooling Schedule
,”
Eur. J. Oper. Res.
,
166
(
1
), pp.
77
92
.
12.
Zhong
,
Y.
,
Ning
,
J.
, and
Zhang
,
H.
,
2012
, “
Multi-Agent Simulated Annealing Algorithm Based on Particle Swarm Optimisation Algorithm
,”
Int. J. Comput. Appl. Technol.
,
43
(
4
), pp.
335
342
.
13.
Zhong
,
Y.
,
Wang
,
L.
,
Wang
,
C.
, and
Zhang
,
H.
,
2012
, “
Multi-Agent Simulated Annealing Algorithm Based on Differential Evolution Algorithm
,”
Int. J. Bio-Inspired Comput.
,
4
(
4
), pp.
217
228
.
14.
Cagan
,
J.
,
Shimada
,
K.
, and
Yin
,
S.
,
2002
, “
A Survey of Computational Approaches to Three-Dimensional Layout Problems
,”
Comput. Aided Des.
,
34
(
8
), pp.
597
611
.
15.
Alba
,
E.
, and
Troya
,
J. M.
,
1999
, “
A Survey of Parallel Distributed Genetic Algorithms
,”
Complexity
,
4
(
4
), pp.
31
52
.
16.
Wales
,
D.
, and
Doye
,
J. P. K.
,
1997
, “
Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
,”
J. Phys. Chem. A
,
101
(
28
), pp.
5111
5116
.
17.
Eberhart
,
R. C.
, and
Shi
,
Y.
,
2001
, “
Particle Swarm Optimization: Developments, Applications and Resources
,”
2001 Congress on Evolutionary Computation
Seoul, Korea, May 27–20,
IEEE
,
New York
, pp.
81
86
.
18.
Jones
,
D. R.
,
Schonlau
,
M.
, and
William
,
J.
,
1998
, “
Efficient Global Optimization of Expensive Black-Box Functions
,”
J. Global Optim.
,
13
(
4
), pp.
455
492
.
19.
Kearfott
,
R. B.
, and
Kreinovich
,
V.
, eds.,
1996
,
Applications of Interval Computations
,
Springer
,
Boston, MA
.
20.
Yin
,
S.
, and
Cagan
,
J.
,
2000
, “
An Extended Pattern Search Algorithm for 3D Component Layout
,”
ASME J. Mech. Des.
,
122
(
1
), pp.
102
108
.
21.
McComb
,
C.
,
Cagan
,
J.
, and
Kotovsky
,
K.
,
2015
, “
Heterogeneous Simulated Annealing Teams: An Optimizing Search Algorithm Inspired by Engineering Design Teams
,”
International Conference on Engineering Design
,
Milan, Italy
, July 27–30, pp.
225
234
.
You do not currently have access to this content.