Evolutionary Algorithms

  • Dirk C. Mattfeld
Part of the Production and Logistics book series (3197)


One way of searching in a large space is to pick solutions at random. This is an aimless approach unless the samples picked are used to guide further search. This is the basic principle of Evolutionary Algorithms (EA) which are introduced in this chapter. EA’s maintain a whole family of solutions in parallel. The various solutions of this family can be seen as samples of the search space. They compete and cooperate through a number of iterations in order to gain improvements.


Genetic Algorithm Gene Pool Travel Salesman Problem Travel Salesman Problem Crossover Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Dirk C. Mattfeld
    • 1
  1. 1.Department of EconomicsUniversity of BremenBremenGermany

Personalised recommendations