Toward an Evolutionary Computing Modeling Language

The importance of domain knowledge in the design of effective evolutionary algorithms (EAs) is widely acknowledged in the meta-heuristics community. In the last few decades, a plethora of EAs has been manually designed by domain experts for solving domain-specific problems. Specialization has been achieved mainly by embedding available domain knowledge into the algorithms. Although programming libraries have been made available to construct EAs, a unifying framework for designing specialized EAs across different problem domains and branches of evolutionary computing does not exist yet. In this paper, we address this issue by introducing an evolutionary computing modeling language (ECML) which is based on the unified modeling language (UML). ECML incorporates basic UML elements and introduces new extensions that are specially needed for the evolutionary computation domain. Subsequently, the concept of meta evolutionary algorithms (MEAs) is introduced as a family of EAs that is capable of interpreting ECML. MEAs are solvers that are not restricted to a particular problem domain or branch of evolutionary computing through the use of ECML. By separating problem-specific domain knowledge from the EA implementation, we show that a unified framework for evolutionary computation can be attained. We demonstrate our approach by applying it to a number of examples.

[1]  Piero P. Bonissone,et al.  Evolutionary algorithms + domain knowledge = real-world evolutionary computation , 2006, IEEE Transactions on Evolutionary Computation.

[2]  Maarten Keijzer,et al.  Evolving Objects: A General Purpose Evolutionary Computation Library , 2001, Artificial Evolution.

[3]  Nicholas J. Radcliffe,et al.  The algebra of genetic algorithms , 1994, Annals of Mathematics and Artificial Intelligence.

[4]  Dario Floreano,et al.  Analog Genetic Encoding for the Evolution of Circuits and Networks , 2007, IEEE Transactions on Evolutionary Computation.

[5]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[6]  David W. Corne,et al.  No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems , 2003, EMO.

[7]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[8]  Marc Schoenauer,et al.  Take It EASEA , 2000, PPSN.

[9]  James A. Reggia,et al.  Evolutionary Design of Neural Network Architectures Using a Descriptive Encoding Language , 2006, IEEE Transactions on Evolutionary Computation.

[10]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[11]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[12]  Mario Köppen,et al.  Hierarchical Modelling of Evolutionary Computation , 2005 .

[13]  Miguel Nicolau,et al.  Introducing Grammar Based Extensions for Grammatical Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[14]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[15]  David H. Wolpert,et al.  Coevolutionary free lunches , 2005, IEEE Transactions on Evolutionary Computation.

[16]  Stephen John Turner,et al.  Symbiotic Simulation Model Validation for Radiation Detection Applications , 2009, 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation.

[17]  Peter A. Whigham,et al.  Grammatically-based Genetic Programming , 1995 .

[18]  Michael O'Neill,et al.  An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem , 2005, EvoCOP.

[19]  Helen Pearson,et al.  Genetics: What is a gene? , 2006, Nature.

[20]  Thomas Bäck,et al.  The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[21]  Kenneth de Jong,et al.  Evolutionary computation: a unified approach , 2007, GECCO.

[22]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[23]  Stephen John Turner,et al.  Symbiotic Simulation Systems: An Extended Definition Motivated by Symbiosis in Biology , 2008, 2008 22nd Workshop on Principles of Advanced and Distributed Simulation.

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

[25]  M. O'Neill,et al.  Grammatical evolution , 2001, GECCO '09.

[26]  Kendall Scott,et al.  UML distilled - a brief guide to the Standard Object Modeling Language (2. ed.) , 2000, notThenot Addison-Wesley object technology series.

[27]  C. Bierwirth A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[28]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[29]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[30]  Richard Fujimoto,et al.  Grand Challenges for Modeling and Simulation Dagstuhl Report , 2002 .