Fitness landscapes based on sorting and shortest paths problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2439, Issue , 2002, Pages 54-63

  Scharnow, Jens ^a   Tinnefeld, Karsten ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HEALTH; MULTIOBJECTIVE OPTIMIZATION; POLYNOMIAL APPROXIMATION;

FITNESS LANDSCAPE; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; PRACTICAL PROBLEMS; PROBLEM-SPECIFIC ALGORITHMS; SHORTEST PATH; SINGLE OBJECTIVE OPTIMIZATION PROBLEMS;

EVOLUTIONARY ALGORITHMS;

EID: 84944314799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45712-7_6     Document Type: Conference Paper

References (10)

1. Bäck, T., Fogel, D.B., and Michalewicz, Z. (Eds.) (1997). Handbook of Evolutionary Computation. Oxford University Press.
2. Droste, S., Jansen, T., and Wegener, I. (1998a). A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation 6, 185–196.
3. Droste, S., Jansen, T., and Wegener, I. (1998b). On the optimization of unimodal functions with the (1+1) evolutionary algorithm. Parallel Problem Solving from Nature-PPSN V, LNCS 1498, 13–22.
4. Horn, J., Goldberg, D.E., and Deb, K. (1994). Long path problems. Parallel Problem Solving from Nature-PPSN III, LNCS 866, 149–158.
5. Jansen, T., and Wegener, I. (2001a). Real royal road functions - where crossover provably is essential. Genetic and Evolutionary Computation Conf.-GECCO, 375–382.
6. Jansen, T., and Wegener, I. (2001b). Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. on Evolutionary Computation 5, 589–599.
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.
8. Petersson, O., and Moffat, A. (1995). A framework for adaptive sorting. Discrete Applied Mathematics 59, 153–179.
9. Rudolph, G. (1997). How mutations and selection solve long path problems in polynomial expected time. Evolutionary Computation 4, 195–205.
10. Wegener, I. (2001). Theoretical aspects of evolutionary algorithms. Int. Colloq. on Automata, Languages, and Programming-ICALP, LNCS 2076, 64–78.