Drawing Inspiration From Human Design Teams for Better Search and Optimization: The Heterogeneous Simulated Annealing Teams Algorithm

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.

[1]  Christopher McComb,et al.  HETEROGENEOUS SIMULATED ANNEALING TEAMS: AN OPTIMIZING SEARCH ALGORITHM INSPIRED BY ENGINEERING DESIGN TEAMS , 2015 .

[2]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[3]  J. Cagan,et al.  An Extended Pattern Search Algorithm for Three-Dimensional Component Layout , 2000 .

[4]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999 .

[5]  Jonathan Cagan,et al.  Simulated Annealing and the Generation of the Objective Function: A Model of Learning During Problem Solving , 1997, Comput. Intell..

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Jonathan Cagan,et al.  Concurrent Optimization of Computationally Learned Stylistic Form and Functional Goals , 2012 .

[8]  Christopher McComb,et al.  Rolling with the punches: An examination of team performance in a design task subject to drastic changes , 2015 .

[9]  R. B. Kearfott,et al.  Applications of interval computations , 1996 .

[10]  Jonathan Cagan,et al.  Design Team Convergence: The Influence of Example Solution Quality , 2009 .

[11]  Hui Zhang,et al.  Multi-agent simulated annealing algorithm based on particle swarm optimisation algorithm , 2012, Int. J. Comput. Appl. Technol..

[12]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999, Complex..

[13]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[14]  Christopher McComb,et al.  Lifting the Veil: Drawing insights about design teams from a cognitively-inspired computational model , 2015 .

[15]  J. Doye,et al.  Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms , 1997, cond-mat/9803344.

[16]  Jonathan Cagan,et al.  A survey of computational approaches to three-dimensional layout problems , 2002, Comput. Aided Des..

[17]  Jami J. Shah,et al.  Empirical Studies of Designer Thinking: Past, Present, and Future , 2015 .

[18]  Hui Zhang,et al.  Multi-agent simulated annealing algorithm based on differential evolution algorithm , 2012, Int. J. Bio Inspired Comput..

[19]  Ashok K. Goel,et al.  Cognitive, collaborative, conceptual and creative - Four characteristics of the next generation of knowledge-based CAD systems: A study in biologically inspired design , 2012, Comput. Aided Des..

[20]  Patrick Siarry,et al.  A theoretical study on the behavior of simulated annealing leading to a new cooling schedule , 2005, Eur. J. Oper. Res..

[21]  Jonathan Cagan,et al.  Synergistic human-agent methods for deriving effective search strategies: the case of nanoscale design , 2015 .

[22]  Linden J. Ball,et al.  Structured and opportunistic processing in design: a critical discussion , 1995, Int. J. Hum. Comput. Stud..