Crossover can provably be useful in evolutionary computation

Theoretical Computer Science

Volumn 425, Issue , 2012, Pages 17-33

  Doerr, Benjamin ^a   Happ, Edda ^a   Klein, Christian ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Crossover; Runtime analysis; Shortest path

Indexed keywords

CROSSOVER; CROSSOVER OPERATOR; RUN-TIME ANALYSIS; SHORTEST PATH; SHORTEST PATH PROBLEM;

GRAPH THEORY;

EVOLUTIONARY ALGORITHMS;

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

References (32)

1. C.W. Ahn, and R. Ramakrishna A genetic algorithm for shortest path routing problem and the sizing of populations IEEE Transactions on Evolutionary Computation 6 2002 566 579
2. N. Alon, and J.H. Spencer The Probabilistic Method 2nd edition 2000 Wiley
3. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2nd edition 2001 MIT Press
4. B. Doerr, E. Happ, and C. Klein A tight bound for the (1 + 1)-EA on the single source shortest path problem Proceedings of the 2007 IEEE Congress on Evolutionary Computation CEC 2007 IEEE Press 1890 1895
5. S. Fischer, and I. Wegener The Ising model on the ring: mutation versus recombination Proceedings of the 2004 Conference on Genetic and Evolutionary Computation GECCO Lecture Notes in Computer Science vol. 3102 2004 Springer 1113 1124 (Pubitemid 39747301)
6. R.W. Floyd Algorithm 97: shortest path Communications of the ACM 5 1962 345
7. S. Forrest Genetic algorithms: Principles of natural selection applied to computation Science 261 1993 872 878 (Pubitemid 23275801)
8. M.R. Garey, and D.S. Johnson Computers and Intractability; A Guide to the Theory of NP-Completeness 1979 W.H. Freeman & Co.
9. J.H. Holland Adaption in Natural and Artificial Systems 1975 University of Michigan Press
10. J. Inagaki, M. Haseyama, and H. Kitajima A genetic algorithm for determining multiple routes and its applications Proceedings of the 1999 IEEE International Symposium on Circuits and Systems ISCAS 1999 IEEE Press 137 140
11. T. Jansen, K.A. De Jong, and I. Wegener On the choice of the offspring population size in evolutionary algorithms Evolutionary Computation 13 2005 413 440 (Pubitemid 43955277)
12. T. Jansen, and I. Wegener On the analysis of evolutionary algorithms a proof that crossover really can help Proceedings of the 7th Annual European Symposium on Algorithms ESA Lecture Notes in Computer Science vol. 1643 1999 Springer 184 193
13. T. Jansen, and I. Wegener The analysis of evolutionary algorithms a proof that crossover really can help Algorithmica 34 2002 47 66
14. T. Jansen, and I. Wegener Real royal road functions where crossover provably is essential Discrete Applied Mathematics 149 2005 111 125 (Pubitemid 41000311)
15. M. Jerrum, and A. Sinclair The Markov chain Monte Carlo method: an approach to approximate counting and integration D Hochbaum, Approximations for NP-hard Problems 1996 PWS Publishing 482 520
16. D.B. Johnson Efficient algorithms for shortest paths in sparse networks Journal of the ACM 24 1977 1 13
17. S. Kirkpatrick, D. Gelatt Jr., and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
18. S. Liang, A.N. Zincir-Heywood, and M.I. Heywood Intelligent packets for dynamic network routing using distributed genetic algorithm Proceedings of the 2002 Conference on Genetic and Evolutionary Computation GECCO 2002 Morgan Kaufmann 88 96
19. S. Liang, A.N. Zincir-Heywood, and M.I. Heywood Adding more intelligence to the network routing problem: AntNet and Ga-agents Applied Soft Computing 6 2006 244 257 (Pubitemid 43326124)
20. K. Mehlhorn, and S. Nher LEDA: A Platform for Combinatorial and Geometric Computing 1999 Cambridge University Press
21. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller Equations of state calculations by fast computing machines Journal of Chemical Physics 21 1953 1087 1091
22. M. Mitchell, J.H. Holland, and S. Forrest When will a genetic algorithm outperform hill climbing? Proceeding of the 7th Neural Information Processing Systems Conference NIPS Advances in Neural Information Processing Systems vol. 6 1993 Morgan Kaufmann 51 58
23. P.S. Oliveto, J. He, and X. Yao Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results International Journal of Automation and Computing 4 2007 281 293 (Pubitemid 47167355)
24. Y. Rabani, Y. Rabinovich, and A. Sinclair A computational view of population genetics Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing STOC 1995 ACM Press 83 92
25. Y. Rabinovich, A. Wigderson, An analysis of a simple genetic algorithm, in: Proceedings of the 4th International Conference on Genetic Algorithms, 1991, pp. 215221.
26. Y. Rabinovich, and A. Wigderson Techniques for bounding the convergence rate of genetic algorithms Random Structures & Algorithms 14 1999 111 138
27. J. Scharnow, K. Tinnefeld, and I. Wegener The analysis of evolutionary algorithms on sorting and shortest paths problems Journal of Mathematical Modelling and Algorithms 3 2004 349 366 (Pubitemid 40317583)
28. T. Storch, and I. Wegener Real royal road functions for constant population size Theoretical Computer Science 320 2004 123 134
29. D. Sudholt Crossover is provably essential for the Ising model on trees Proceedings of the 2005 Conference on Genetic and Evolutionary Computation GECCO 2005 ACM Press 1161 1167 (Pubitemid 43226428)
30. S. Warshall A theorem on Boolean matrices Journal of the ACM 9 1962 11 12
31. I. Wegener Simulated annealing beats Metropolis in combinatorial optimization Proceedings of the 32nd International Colloquium on Automata, Languages and Programming ICALP Lecture Notes in Computer Science vol. 3580 2005 Springer 589 601 (Pubitemid 41436131)
32. C. Witt Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions Evolutionary Computation 14 2006 65 86 (Pubitemid 43955273)