230 Chapter 8 GenetiC alGorithms
With the previous algorithm, a new offspring can be generated, with
City 3 as the random starting point. This member is (3, 2, 1, 4, 5), which
is a legal plan. The fitness function is the cost or length of the path. When
a minimum cost/shortest path state is achieved, further evolution can be
terminated.
8.9 ISLAND-BASED GENETIC ALGORITHMS
Because we can imagine a GA with a single population as a form of
paral lelization, more benefits can be obtained by evolving a number of
subpopulations in tandem. This is called a cooperative model in which we
have islands representing different populations. Naturally, selection, crossover,
and mutation occur in every subpopulation ...