Ignoble trails - Where crossover is provably harmful

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

Volumn 5199 LNCS, Issue , 2008, Pages 92-101

  Richter, J Neal ^a   Wright, Alden ^b   Paxton, John ^a  

^a MONTANA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MONTANA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CROSS OVERS; CROSSOVER OPERATORS; EXPONENTIAL TIMES; GENETIC OPERATORS; POLYNOMIAL TIMES; ROYAL ROADS; SCHEMA THEOREMS; CROSSOVER OPERATOR; EXCEL; EXPONENTIAL TIME; POLYNOMIAL-TIME;

DIESEL ENGINES; GENETIC ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; ROADS AND STREETS; SPREADSHEETS; ALGORITHMS;

PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING;

EID: 56449107854     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87700-4_10     Document Type: Conference Paper

References (17)

1. Mitchell, M., Forrest, S., Holland, J.H.: The royal road for genetic algorithms: Fitness landscapes and GA performance. In: Varela, F.J., Bourgine, P. (eds.) Proceedings of the First European Conference on Artificial Life. Toward a Practice of Autonomous Systems, pp. 243-254. MIT Press, Cambridge (1992)
2. Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hypothesis. In: Whitley, L.D. (ed.) Foundations of genetic algorithms 2, pp. 109-126. Morgan Kaufmann, San Mateo (1993)
3. Mitchell, M., Holland, J.H., Forrest, S.: When will a genetic algorithm outperform hill climbing. In: Cowan, J.D., Tesauro, G., Alspector, J. (eds.) NIPS, pp. 51-58. Morgan Kaufmann, San Francisco (1993)
4. Jansen, T., Wegener, I.: Real royal road functions-where crossover provably is essential. Discrete Applied Mathematics 149(1-3), 111-125 (2005)
5. Poli, R., Wright, A.H., McPhee, N., Langdon, W.: Emergent behaviour, population-based search and low-pass filtering. In: Proceedings of the Congress on Evolutionary Computation (CEC) 2006, pp. 88-95. IEEE Press, Los Alamitos (2006)
6. Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In: Whitley, L.D. (ed.) FOGA, pp. 93-108. Morgan Kaufmann, San Francisco (1992)
7. Watson, R.A.: Analysis of recombinative algorithms on a, non-separable building-block problem. In: Foundations of Genetic Algorithms 6, pp. 69-89. Morgan Kaufmann, San Francisco (2001)
8. Watson, R.A., Pollack, J.B.: Hierarchically consistent test problems for genetic algorithms. In: Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of the Congress on Evolutionary Computation, Mayflower Hotel, Washington D.C., USA, vol. 2, pp. 6-9. IEEE Press, Los Alamitos (1999)
9. Dietzfelbinger, M., Naudts, B., Hoyweghen, C.V., Wegener, I.: The analysis of a recombinative hill-climber on h-iff, IEEE Trans. Evolutionary Computation 7(5), 417-423 (2003)
10. Jansen, T., Wegener, I.: The analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica 34(1), 47-66 (2002)
11. Storch, T., Wegener, I.: Real royal road functions for constant population size. Theor. Comput. Sci. 320(1), 123-134 (2004)
12. Fischer, S., Wegener, I.: The one-dimensional ising model: Mutation versus recombination. Theor. Comput. Sci. 344(2-3), 208-225 (2005)
13. Sudholt, D.: Crossover is provably essential for the ising model on trees. In: GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, pp. 1161-1167. ACM, New York (2005)
14. Doerr, B., Happ, E., Klein, C.: Crossover is provably useful in evolutionary computation. In: GECCO 2008: Proceedings of the 2008 conference on Genetic and evolutionary computation (to appear, 2008)
15. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
16. Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Dr. Kovac, Hamburg (1997)
17. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, New York (1995)