Real royal road functions for constant population size

Theoretical Computer Science

Volumn 320, Issue 1, 2004, Pages 123-134

  Storch, Tobias ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Evolutionary algorithm; Genetic algorithm; One point crossover; Population size; Royal road function; Run time analysis; Uniform crossover

Indexed keywords

FUNCTION EVALUATION; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; MUTAGENESIS; OPTIMIZATION; PROBABILITY; THEOREM PROVING;

ONE-POINT CROSSOVER; POPULATION SIZE; ROYAL ROAD FUNCTION; RUN TIME ANALYSIS; UNIFORM CROSSOVER;

POPULATION STATISTICS;

EID: 2442505438     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.047     Document Type: Article

References (11)

1. Dietzfelbinger M., Naudts B., van Hoyweghen C., Wegener I. The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evolutionary Comput. 7:2003;417-423.
2. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, Reading, MA.
3. Holland J.H. Adaptation in Natural and Artificial Systems. 1975;The University of Michigan Press, Ann Arbor.
4. T. Jansen, I. Wegener, Real royal road functions - where crossover provably is essential, in: L. Spector, E.D. Goodman, A. Wu, et al. (Eds.), Proc. of GECCO'2001, Morgan Kaufmann, San Francisco, 2001, pp. 375-382.
5. T. Jansen, I. Wegener, On the utility of populations in evolutionary algorithms, in: L. Spector, E.D. Goodman, A. Wu, et al. (Eds.), Proc. of GECCO'2001, Morgan Kaufmann, San Francisco, 2001, pp. 1034-1041.
6. Jansen T., Wegener I. Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings with the same fitness. IEEE Trans. Evolutionary Comput. 5:2001;589-599.
7. M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, Cambridge, 1996 (Chapter 4.2).
8. M. Mitchell, S. Forrest, J.H. Holland, The royal road for genetic algorithms: fitness landscapes and GA performance, in: F.J. Varela, P. Bourgine (Eds.), Proc. First European Conf. on Artificial Life, MIT Press, Cambridge, 1992, pp. 245-254.
9. M. Mitchell, J.H. Holland, S. Forrest, When will a genetic algorithm outperform hill-climbing? in: J.L. Cowan, G. Tesauro, J. Alspector (Eds.), Advances in NIPS 6, Morgan Kaufmann, San Mateo, 1994, pp. 51-58.
10. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge.
11. R.A. Watson, J.B. Pollack, Hierarchically-consistent test problems for genetic algorithms, in: P.J. Angeline, Z. Michalewicz, M. Schoenauer, et al. (Eds.), Proc. of the CEC'1999, IEEE Press, Piscataway, 1999, pp. 1406-1413.