Real royal road functions - Where crossover provably is essential

Discrete Applied Mathematics

Volumn 149, Issue 1-3, 2005, Pages 111-125

  Jansen, Thomas ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Crossover; Evolutionary algorithms; Genetic algorithms

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FUNCTIONS; POLYNOMIALS; PROBABILITY;

CROSSOVER; EVOLUTION STRATEGIES; MUTATIONS; PSEUDO-BOOLEAN FUNCTIONS;

GENETIC ALGORITHMS;

EID: 22344431964     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.02.019     Document Type: Article

References (15)

1. S. Forrest, and M. Mitchell Relative building-block fitness and the building-block hypothesis D. Whitley Proceedings of the Second Workshop on the Foundations of Genetic Algorithms (FOGA '92) 1993 Morgan Kaufmann San Mateo, CA 109 126
2. D.E. Goldberg Genetic Algorithms in Search, Optimization, and Machine Learning 1989 Addison-Wesley Reading, MA
3. J.H. Holland Adaption in Natural and Artificial Systems 1992 MIT Press Cambridge, MA
4. T. Jansen, and I. Wegener On the analysis of evolutionary algorithms - a proof that crossover really can help J. Nešetřil Proceedings of the Seventh Annual European Symposium on Algorithms (ESA '99), Lecture Notes in Computer Science vol. 1643 1999 Springer Berlin 184 193
5. M. Mitchell An Introduction to Genetic Algorithms 1996 MIT Press Cambridge, MA (Chapter 4.2)
6. M. Mitchell, S. Forrest, and J.H. Holland The royal road function for genetic algorithms: fitness landscapes and GA performance F.J. Varela P. Bourgine Toward a Practice of Autonomous Systems, Proceedings of the First European Conference on Artificial Life 1992 MIT Press Cambridge, MA 245 254
7. M. Mitchell, J.H. Holland, and S. Forrest When will a genetic algorithm outperform hill climbing? Advances in Neural Information Processing Systems (NIPS 6) Morgan Kaufmann, San Mateo, CA 1994 51 58
8. A.M. Mood, F.A. Graybill, and D.C. Boes Introduction to the Theory of Statistics 1974 McGraw-Hill Singapore
9. R. Motwani, and P. Raghavan Randomized Algorithms 1995 Cambridge University Press Cambridge
10. R.A. Watson Analysis of recombinative algorithms on a non-separable building-block problem W.N. Martin W.M. Spears Proceedings of the Sixth Workshop on the Foundations of Genetic Algorithms (FOGA 2000) Morgan Kaufmann, San Mateo, CA 2000 69 89
11. R.A. Watson, G.S. Hornby, and J.B. Pollack Modeling building-block interdependency A.E. Eiben T. Bäck M. Schoenauer H.-P. Schwefel Parallel Problem Solving From Nature (PPSN V), Lecture Notes in Computer Science vol. 1998 1998 Springer Berlin, Germany 97 106
12. R.A. Watson, and J.B. Pollack Hierarchically-consistent test problems for genetic algorithms Congress on Evolutionary Computation (CEC '99) IEEE Press, Piscataway, NJ 1999 1406 1413
13. R.A. Watson, and J.B. Pollack Recombination without respect schema disruption in genetic algorithm crossover D. Whitley D. Goldberg E. Cantu-Paz L. Spector I. Parmee H.-G. Beyer Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000) Morgan Kaufmann, San Mateo, CA 2000 112 119
14. R.A. Watson, and J.B. Pollack Symbiotic combination as an alternative to sexual recombination in genetic algorithms M. Schoenauer K. Deb G. Rudolph X. Yao E. Lutton J.J. Merelo H.-P. Schwefel Parallel Problem Solving from Nature (PPSN VI), Lecture Notes in Computer Science vol. 1917 2000 Springer Berlin, Germany 425 434
15. A.H. Wright, and Y. Zhao Markov chain models of genetic algorithms W. Banzhaf J. Daida A.E. Eiben M. Garzon V. Honavar M. Jakiela R.E. Smith Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '99) Morgan Kaufmann, San Mateo, CA 1999 734 741