HETEROGENEOUS SIMULATED ANNEALING TEAMS: AN OPTIMIZING SEARCH ALGORITHM INSPIRED BY ENGINEERING DESIGN TEAMS
Editor: Christian Weber, Stephan Husung, Marco CantaMESsa, Gaetano Cascini, Dorian Marjanovic, Serena Graziosi
Author: McComb, Christopher; Cagan, Jonathan; Kotovsky, Kenneth
Institution: Carnegie Mellon University, United States of America
Section: Design Methods and Tools - part 2
Although insights uncovered by design cognition are often utilized to develop the methods used by human designers, using such insights to inform computational methodologies also has the potential to improve the performance of design algorithms. This paper uses insights from research on design cognition and design teams to inform a better simulated annealing search algorithm. Simulated annealing has already been established as a model of individual problem solving. This paper introduces the Heterogeneous Simulated Annealing Team (HSAT) algorithm, a multi-agent simulated annealing algorithm. Each agent controls an adaptive annealing schedule, allowing the team develop heterogeneous search strategies. Such diversity is a natural part of engineering design, and boosts performance in other multi-agent algorithms. Further, interaction between agents in HSAT is structured to mimic interaction between members of a design team. Performance is compared to several other simulated annealing algorithms, a random search algorithm, and a gradient-based algorithm. Compared to other algorithms, the team-based HSAT algorithm returns better average results with lower variance.