A generic evolutionary computation approach based upon genetic algorithms and evolution strategies

• Autorzy: Affenzeller, M.
• Języki publikacji: EN

Abstrakty

EN

Many problems that are treated by genetic algorithms (GA) belong to the class of NP-complete problems. GA are frequently faced with a problem similar to that of stagnating in a local but not global solution. This drawback, called premature convergence, occurs when the population of a GA reaches such a suboptimal state that the genetic operators can no longer produce offspring that outperforms their parents. The author considers GA as artificial self-organizing processes in a bionically inspired generic way. In doing so he introduces an advanced selection model for GA that allows adaptive selective pressure handling in a way that is quite similar to evolution strategies. This enhanced GA model allows further extensions like the introduction of a concept to handle multiple crossover operators in parallel or the introduction of a concept of segregation and reunification of smaller subpopulations. Both extensions rely on a variable selective pressure. The experimental part of the paper discusses the new algorithms for the traveling salesman problem (TSP) as a well documented instance of a multimodal combinatorial optimization problem achieving results which significantly outperform the results obtained with a contrastable GA.

Słowa kluczowe

EN

generic evolutionary computation; genetic algorithms; evolution strategies; premature convergence; suboptimal state; artificial self-organizing processes; adaptive selective pressure handling; reunification; traveling salesman problem; TSP; multimodal combinatorial optimization

• Czasopismo: Systems Science
• Rocznik: 2002
• Tom: Vol. 28, nr 2
• Strony: 59-71
• Opis fizyczny: Bibliogr. 14 poz.

Twórcy

autor

Affenzeller, M.,

• Institute of Systems Science Systems Theory and Information Technology, Johannes Kepler University, Altenbergerstrasse 69, A-4040 Linz, Austria