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.
KeywordsGenetic Algorithm Gene Pool Travel Salesman Problem Travel Salesman Problem Crossover Operator
Unable to display preview. Download preview PDF.