Fitness Landscapes Based on Sorting and Shortest Paths Problems
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 landscapes 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, while they are easy as multi-objective optimization problems.
KeywordsEvolutionary Algorithm Success Probability Mutation Operator Fitness Landscape Short Path Problem
Unable to display preview. Download preview PDF.
- 1.Bäck, T., Fogel, D.B., and Michalewicz, Z. (Eds.) (1997). Handbook of Evolutionary Computation. Oxford University Press.Google Scholar
- 4.Horn, J., Goldberg, D.E., and Deb, K. (1994). Long path problems. Parallel Problem Solving from Nature— PPSN III, LNCS 866, 149–158.Google Scholar
- 5.Jansen, T., and Wegener, I. (2001a). Real royal road functions-where crossover provably is essential. Genetic and Evolutionary Computation Conf.— GECCO, 375–382.Google Scholar
- 7.Mitchell, M., Holland, J.H., and Forrest, S. (1994). 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.Google Scholar
- 10.Wegener, I. (2001). Theoretical aspects of evolutionary algorithms. Int. Colloq. on Automata, Languages, and Programming— ICALP, LNCS 2076, 64–78.Google Scholar