Skip to main content
SpringerLink
Log in

The analysis of evolutionary algorithms on sorting and shortest paths problems

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

The analysis of evolutionary algorithms is up to now limited to special classes of functions and fitness landscapes. E.g., it is not possible to characterize the set of TSP instances (or another NP-hard combinatorial optimization problem) which are solved by a generic evolutionary algorithm (EA) in an expected time bounded by some given polynomial. As a first step from artificial functions to typical problems from combinatorial optimization, we analyze simple EAs on well-known problems, namely sorting and shortest paths. Although it cannot be expected that EAs outperform the well-known problem specific algorithms on these simple problems, it is interesting to analyze how EAs work on these problems. The following results are obtained:

  • - Sorting is the maximization of “sortedness” which is measured by one of several well-known measures of presortedness. The different measures of presortedness lead to fitness functions of quite different difficulty for EAs.

  • - Shortest paths problems are hard for all types of EA, if they are considered as single-objective optimization problems, whereas they are easy as multi-objective optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bäck, T., Fogel, D. B. and Michalewicz, Z. (eds): Handbook of Evolutionary Computation, Oxford University Press, 1997.

  2. S. Droste T. Jansen I. Wegener (1998) ArticleTitleA rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs Evolutionary Computation 6 185–196

    Google Scholar 

  3. S. Droste T. Jansen I. Wegener (1998) ArticleTitleOn the optimization of unimodal functions with the (1 + 1) evolutionary algorithm Parallel Problem Solving from Nature - PPSN V 1498 13–22

    Google Scholar 

  4. S. Droste T. Jansen I. Wegener (2002) ArticleTitleOn the analysis of the (1 + 1) evolutionary algorithm Theoret. Comput. Sci. 276 51–81

    Google Scholar 

  5. W. Feller (1971) An Introduction to Probability Theory and its Applications Wiley New York

    Google Scholar 

  6. O. Giel I. Wegener (2003) ArticleTitleEvolutionary algorithms and the maximum matching problem Proc. of 20th Symp. of Theoretical Aspects of Computer Science - STACS 2607 415–426

    Google Scholar 

  7. Graham, R. L., Knuth, D. E. and Patashnik, O.: Concrete Mathematics, Addison-Wesley, 1994.

  8. J. Horn D. E. Goldberg K. Deb (1994) ArticleTitleLong path problems Parallel Problem Solving from Nature - PPSN III 866 149–158

    Google Scholar 

  9. Jansen, T. and Wegener, I.: Real royal road functions - where crossover provably is essential, in Genetic and Evolutionary Computation Conf. - GECCO, 2001, pp. 375–382.

  10. Knuth, D. E.: The Art of Computer Programming. Vol. 3: Searching and Sorting, Addison-Wesley, 1973.

  11. Mitchell, M., Holland, J. H. and Forrest, S.: When will a genetic algorithm outperform hill climbing, in J. Cowan, G. Tesauro and J. Alspector (eds), Advances in Neural Information Processing Systems, Morgan Kaufman, 1994, pp. 51–58.

  12. Motwani, R. and Raghavan, P.: Randomized Algorithms, Cambridge University Press, 1995.

  13. M. Orlowski M. Pachter (1989) ArticleTitleAn algorithm for the determination of a longest increasing subsequence in a sequence Comput. Math. Appl. 17 1073–1075

    Google Scholar 

  14. O. Petersson A. Moffat (1995) ArticleTitleA framework for adaptive sorting Discrete Appl. Math. 59 153–179

    Google Scholar 

  15. G. Rudolph (1997) ArticleTitleHow mutations and selection solve long path problems in polynomial expected time Evolutionary Computation 4 195–205

    Google Scholar 

  16. J. Scharnow K. Tinnefeld I. Wegener (2002) ArticleTitleFitness landscapes based on sorting and shortest paths problems Parallel Problem Solving from Nature - PPSN VII 2439 54–63

    Google Scholar 

  17. I. Wegener (2001) ArticleTitleTheoretical aspects of evolutionary algorithms Int. Colloq. on Automata, Languages, and Programming - ICALP 2076 64–78

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, LS2, University of Dortmund, 44221, Dortmund, Germany

    Jens Scharnow, Karsten Tinnefeld & Ingo Wegener

Authors
  1. Jens Scharnow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karsten Tinnefeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ingo Wegener
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center “Computational Intelligence” (SFB 531).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scharnow, J., Tinnefeld, K. & Wegener, I. The analysis of evolutionary algorithms on sorting and shortest paths problems. J Math Model Algor 3, 349–366 (2005). https://doi.org/10.1007/s10852-005-2584-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-005-2584-0

Key words

Mathematics Subject Classifications (2000)

Search

Navigation