Protocol-Based Multi-Agent Systems: Examining the Effect of Diversity, Dynamism, and Cooperation in Heuristic Optimization Approaches

Many heuristic optimization approaches have been developed to combat the ever-increasing complexity of engineering problems. In general, these approaches can be classified based on the diversity of the search strategies used, the amount of change in these search strategies during the optimization process, and the level of cooperation between these strategies. A review of the literature indicates that approaches that are simultaneously very diverse, highly dynamic, and cooperative are rare but have immense potential for finding high quality final solutions. In this work, a taxonomy of heuristic optimization approaches is introduced and used to motivate a new approach called protocol-based multi-agent systems. This approach is found to produce final solutions of much higher quality when its implementation includes the use of multiple search protocols, the adaptation of these protocols during the optimization, and the cooperation between these protocols than when these characteristics are absent.

[1]  Jim Smith,et al.  Operator and parameter adaptation in genetic algorithms , 1997, Soft Comput..

[2]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[3]  George S. Dulikravich,et al.  Multi-Objective Hybrid Evolutionary Optimization with Automatic Switching , 2006 .

[4]  Erick Cantú-Paz,et al.  Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms , 2001, J. Heuristics.

[5]  Thomas Bäck,et al.  Genetic Algorithms and Evolution Strategies - Similarities and Differences , 1990, PPSN.

[6]  Jonathan Cagan,et al.  A Simulated Annealing-Based Approach to Three-Dimensional Component Packing , 1995 .

[7]  Stephen F. Smith,et al.  Combining Multiple Heuristics Online , 2007, AAAI.

[8]  Marek Petrik,et al.  Learning parallel portfolios of algorithms , 2006, Annals of Mathematics and Artificial Intelligence.

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

[10]  Pedro S. de Souza,et al.  Asynchronous organizations for multi-algorithm problems , 1993, SAC '93.

[11]  Terence C. Fogarty,et al.  Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.

[12]  Jürgen Schmidhuber,et al.  Adaptive Online Time Allocation to Search Algorithms , 2004, ECML.

[13]  Jonathan Cagan,et al.  Evolutionary Multi-Agent Systems: An Adaptive and Dynamic Approach to Optimization , 2009 .

[14]  Jürgen Schmidhuber,et al.  Learning dynamic algorithm portfolios , 2006, Annals of Mathematics and Artificial Intelligence.

[15]  Hartmut Pohlheim Competition and Cooperation in Extended Evolutionary Algorithms , 2001 .

[16]  Thomas Bäck,et al.  Intelligent Mutation Rate Control in Canonical Genetic Algorithms , 1996, ISMIS.

[17]  George S. Dulikravich,et al.  Multi-Objective Hybrid Evolutionary Optimization with Automatic Switching Among Constituent Algorithms , 2008 .

[18]  Yoav Shoham,et al.  Boosting as a Metaphor for Algorithm Design , 2003, CP.

[19]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[20]  Michael E. Mortenson,et al.  Geometric Modeling , 2008, Encyclopedia of GIS.

[21]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

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

[23]  Jonathan Cagan,et al.  Evolutionary Multi-Agent Systems: An Adaptive Approach to Optimization in Dynamic Environments , 2008, DAC 2008.

[24]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[25]  Reinhard Männer,et al.  Investigation of the M-Heuristic for Optimal Mutation Probabilities , 1992, Parallel Problem Solving from Nature.

[26]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[27]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[28]  Jonathan Cagan,et al.  A-Design: An Agent-Based Approach to Conceptual Design in a Dynamic Environment , 1999 .

[29]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[30]  Reinhard Männer,et al.  Towards an Optimal Mutation Probability for Genetic Algorithms , 1990, PPSN.

[31]  D. Thierens Adaptive mutation rate control schemes in genetic algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[32]  J. Cagan,et al.  Objective Function Effect Based Pattern Search—Theoretical Framework Inspired by 3D Component Layout , 2007 .

[33]  John Rachlin,et al.  A-Teams: An Agent Architecture for Optimization and Decision Support , 1998, ATAL.

[34]  Jasper A Vrugt,et al.  Improved evolutionary optimization from genetically adaptive multimethod search , 2007, Proceedings of the National Academy of Sciences.

[35]  H. P Nii,et al.  Blackboard Systems , 1986 .

[36]  Pedro S. de Souza,et al.  Asynchronous Teams: Cooperation Schemes for Autonomous Agents , 1998, J. Heuristics.