Evolutionary Multi-Agent Systems: An Adaptive and Dynamic Approach to Optimization

This paper explores the ability of a virtual team of specialized strategic software agents to cooperate and evolve to adaptively search an optimization design space. Our goal is to demonstrate and understand how such dynamically evolving teams may search more effectively than any single agent or a priori set strategy. We present a core framework and methodology that has potential applications in layout, scheduling, manufacturing, and other engineering design areas. The communal agent team organizational structure employed allows cooperation of agents through the products of their work and creates an ever changing set of individual solutions for the agents to work on. In addition, the organizational structure allows the framework to be adaptive to changes in the design space that may occur during the optimization process. An evolutionary approach is used, but evolution occurs at the strategic rather than the solution level, where the strategies of agents in the team are the decisions for when and how to choose and alter a solution, and the agents evolve over time. As an application of this approach in a static domain, individual solutions are tours in the familiar combinatorial optimization problem of the traveling salesman. With a constantly changing set of these tours, the team, with each agent employing a different solution strategy, must evolve to apply the solution strategies, which are most useful given the solution set at any point in the process. We discuss the extensions to our preliminary work that will make our framework useful to the design and optimization community.

[1]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .

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

[3]  Yoav Shoham,et al.  A portfolio approach to algorithm select , 2003, IJCAI 2003.

[4]  P. Cristea,et al.  Evolutionary intelligent agents , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[5]  Jürgen Schmidhuber,et al.  Optimal Ordered Problem Solver , 2002, Machine Learning.

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 : Advanced Algorithms and Operators , 2000 .

[8]  Narsingh Deo,et al.  Discrete Optimization Algorithms: with Pascal Programs , 2006 .

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

[10]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

[11]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[12]  Sanjay Sachdev,et al.  Explorations in Asynchronous Teams , 1998 .

[13]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

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

[15]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[16]  A. Schrijver,et al.  The Traveling Salesman Problem , 2011 .

[17]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[18]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[19]  Ricardo Vilalta,et al.  Introduction to the Special Issue on Meta-Learning , 2004, Machine Learning.

[20]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

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

[22]  Jonathan Cagan,et al.  Interagent ties in team-based computational configuration design , 2004, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

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

[24]  Arthur C. Graesser,et al.  Is it an Agent, or Just a Program?: A Taxonomy for Autonomous Agents , 1996, ATAL.

[25]  C. Sechen,et al.  New algorithms for the placement and routing of macro cells , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[26]  R. Geoff Dromey,et al.  An algorithm for the selection problem , 1986, Softw. Pract. Exp..

[27]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[28]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[29]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

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

[31]  Alex A. Freitas,et al.  Evolutionary Computation , 2002 .

[32]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[33]  Ivana Kruijff-Korbayová,et al.  A Portfolio Approach to Algorithm Selection , 2003, IJCAI.

[34]  David B. Fogel,et al.  Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .

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

[36]  Georges M. Fadel,et al.  A Fast and Efficient Compact Packing Algorithm for Free-Form Objects , 2008, DAC 2008.

[37]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 , 2000 .

[38]  Kenneth A. De Jong,et al.  Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents , 2000, Evolutionary Computation.