The Spirit of Evolutionary Algorithms

Evolutionary algorithms (EAs), which are based on a powerful principle of evolution: survival of the fittest, and which model some natural phenomena: genetic inheritance and Darwinian strife for survival, constitute an interesting category of modern heuristic search. During the last two decades there has been a growing interest in these algorithms; today, many complex software systems include at least some evolutionary component. However, the process of building an evolutionary program is still art rather than science; often it is based on the intuition and experience of the designer. In this introductory article we present some important ideas behind the construction of evolutionary algorithms. These ideas are illustrated by three test cases: the transportation problem, a particular nonlinear parameter optimization problem, and the traveling salesman problem. We conclude the paper with a brief discussion on how an evolutionary algorithm can be tuned to the problem while solving it, which may increase further efficiency of the algorithm in a significant way.

[1]  Robert G. Reynolds,et al.  Knowledge-based self-adaptation in evolutionary programming using cultural algorithms , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[2]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[3]  Terence C. Fogarty,et al.  Learning the local search range for genetic optimisation in nonstationary environments , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).