Advertisement

Fitness Landscapes and Evolutionary Algorithms

  • Colin R. Reeves
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1829)

Abstract

Evolutionary algorithms (EAs) have been increasingly, and successfully, applied to combinatorial optimization problems. However, EAs are relatively complicated algorithms (compared to local search, for example) and it is not always clear to what extent their behaviour can be explained by the particular set of strategies and parameters used.

One of the most commonly-used metaphors to describe the process of simple methods such as local search is that of a ‘fitness landscape’, but even in this case, describing what we mean by such a term is not as easy as might be assumed.

In this paper, we first present some intuitive ideas and mathematical definitions of what is meant by a landscape and its properties, and review some of the theoretical and experimental work that has been carried out over the past 6 years. We then consider how the concepts associated with a landscape can be extended to search by means of evolutionary algorithms, and connect this with previous work on epistasis variance measurement.

The example of the landscapes of the Onemax function will be considered in some detail, and finally, some conclusions will be drawn on how knowledge of typical landscape properties can be used to improve the efficiency and effectiveness of heuristic search techniques.

Keywords

Local Search Evolutionary Algorithm Travel Salesman Problem Fitness Landscape Gray Code 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Höhn, C., Reeves, C.R.: The crossover landscape for the onemax problem. In: Alander, J. (ed.) Proceedings of the 2nd Nordic Workshop on Genetic Algorithms and their Applications, pp. 27–43. University of Vaasa Press, Vaasa (1996)Google Scholar
  2. 2.
    Jones, T.C.: Evolutionary Algorithms, Fitness Landscapes and Search, Doctoral dissertation, University of New Mexico, Albuquerque, NM (1995)Google Scholar
  3. 3.
    Grover, L.K.: Local search and the local structure of NP-complete problems. Operations Research Letters 12, 235–243 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Stadler, P.F., Wagner, G.P.: Algebraic theory of recombination spaces. Evolutionary Computation 5, 241–275 (1998)CrossRefGoogle Scholar
  5. 5.
    Reeves, C.R.: Predictive measures for problem diffculty. In: Proceedings of 1999 Congress on Evolutionary Computation, pp. 736–743. IEEE Press, Los Alamitos (1999)Google Scholar
  6. 6.
    Culberson, J.C.: Mutation-crossover isomorphisms and the construction of discriminating functions. Evolutionary Computation 2, 279–311 (1995)CrossRefGoogle Scholar
  7. 7.
    Jones, T.C.: Crossover, macromutation and population-based search. In: Eshelman, L.J. (ed.) Proceedings of the 6th International Conference on Genetic Algorithms, pp. 73–80. Morgan Kaufmann, San Francisco (1995)Google Scholar
  8. 8.
    Kauffman, S.: The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, Oxford (1993)Google Scholar
  9. 9.
    Lin, S.: Computer solutions of the traveling salesman problem. Bell Systems Tech. J. 44, 2245–2269 (1965)zbMATHGoogle Scholar
  10. 10.
    Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16, 101–113 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Merz, P., Freisleben, B.: Memetic algorithms and the fitness landscape of the graph bi-partitioning problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem-Solving from Nature—PPSN V, pp. 765–774. Springer, Berlin (1998)CrossRefGoogle Scholar
  12. 12.
    Reeves, C.R.: Landscapes, operators and heuristic search. Annals of Operational Research 86, 473–490 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Johnson, D.S.: Local optimization and the traveling salesman problem. In: Goos, G., Hartmanis, J. (eds.) ICALP 1990. LNCS, vol. 443, pp. 446–461. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  14. 14.
    Martin, O., Otto, S.W., Felten, E.W.: Large step Markov chains for the TSP incorporating local search heuristics. Operations Research Letters 11, 219–224 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Zweig, G.: An effective tour construction and improvement proedure for the traveling salesman problem. Operations Research 43, 1049–1057 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Reeves, C.R., Yamada, T.: Embedded Path Tracing and Neighbourhood Search Techniques in Genetic Algorithms. In: Miettinen, K., Mákelä, M.M., Neittaanmäki, P., Périaux, J. (eds.) Evolutionary Algorithms in Engineering and Computer Science, pp. 95–111. John Wiley & Sons, Chichester (1999)Google Scholar
  17. 17.
    Reeves, C.R., Yamada, T.: Goal-Oriented Path Tracing Methods. In: Corne, D.A., Dorigo, M., Glover, F. (eds.) New Methods in Optimization. McGraw-Hill, London (1999)Google Scholar
  18. 18.
    Reeves, C.R., Yamada, T.: Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation 6, 45–60 (1998)CrossRefGoogle Scholar
  19. 19.
    Yamada, T., Reeves, C.R.: Solving the Csum permutation flowshop scheduling problem by genetic local search. In: Proc. of 1998 International Conference on Evolutionary Computation, pp. 230–234. IEEE Press, Los Alamitos (1998)Google Scholar
  20. 20.
    Reeves, C.R.: Genetic algorithms and neighbourhood search. In: Fogarty, T.C. (ed.) Evolutionary Computing: AISB Workshop, Leeds, UK, pp. 115–130. Springer, Berlin (1994) (selected Papers)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Colin R. Reeves
    • 1
  1. 1.School of Mathematical and Information SciencesCoventry UniversityCoventryUK

Personalised recommendations