The analysis of evolutionary algorithms on sorting and shortest paths problems
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- Bäck, T., Fogel, D. B. and Michalewicz, Z. (eds): Handbook of Evolutionary Computation, Oxford University Press, 1997.
- Droste, S., Jansen, T., Wegener, I. (1998) A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation 6: pp. 185-196
- Droste, S., Jansen, T., Wegener, I. (1998) On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm. Parallel Problem Solving from Nature - PPSN V 1498: pp. 13-22
- Droste, S., Jansen, T., Wegener, I. (2002) On the analysis of the (1 + 1) evolutionary algorithm. Theoret. Comput. Sci. 276: pp. 51-81
- Feller, W. (1971) An Introduction to Probability Theory and its Applications. Wiley, New York
- Giel, O., Wegener, I. (2003) Evolutionary algorithms and the maximum matching problem. Proc. of 20th Symp. of Theoretical Aspects of Computer Science - STACS 2607: pp. 415-426
- Graham, R. L., Knuth, D. E. and Patashnik, O.: Concrete Mathematics, Addison-Wesley, 1994.
- Horn, J., Goldberg, D. E., Deb, K. (1994) Long path problems. Parallel Problem Solving from Nature - PPSN III 866: pp. 149-158
- 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.
- Knuth, D. E.: The Art of Computer Programming. Vol. 3: Searching and Sorting, Addison-Wesley, 1973.
- 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.
- Motwani, R. and Raghavan, P.: Randomized Algorithms, Cambridge University Press, 1995.
- Orlowski, M., Pachter, M. (1989) An algorithm for the determination of a longest increasing subsequence in a sequence. Comput. Math. Appl. 17: pp. 1073-1075
- Petersson, O., Moffat, A. (1995) A framework for adaptive sorting. Discrete Appl. Math. 59: pp. 153-179
- Rudolph, G. (1997) How mutations and selection solve long path problems in polynomial expected time. Evolutionary Computation 4: pp. 195-205
- Scharnow, J., Tinnefeld, K., Wegener, I. (2002) Fitness landscapes based on sorting and shortest paths problems. Parallel Problem Solving from Nature - PPSN VII 2439: pp. 54-63
- Wegener, I. (2001) Theoretical aspects of evolutionary algorithms. Int. Colloq. on Automata, Languages, and Programming - ICALP 2076: pp. 64-78
- The analysis of evolutionary algorithms on sorting and shortest paths problems
Journal of Mathematical Modelling and Algorithms
Volume 3, Issue 4 , pp 349-366
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- randomized search heuristics
- evolutionary algorithms
- analysis of expected run time
- shortest paths