Crossover can provably be useful in evolutionary computation
- 12 July 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 539-546
- https://doi.org/10.1145/1389095.1389202
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Adding more intelligence to the network routing problem: AntNet and Ga-agentsApplied Soft Computing, 2006
- Real royal road functions—where crossover provably is essentialDiscrete Applied Mathematics, 2005
- Simulated Annealing Beats Metropolis in Combinatorial OptimizationLecture Notes in Computer Science, 2005
- Real royal road functions for constant population sizeTheoretical Computer Science, 2004
- The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths ProblemsJournal of Mathematical Modelling and Algorithms, 2004
- A genetic algorithm for shortest path routing problem and the sizing of populationsIEEE Transactions on Evolutionary Computation, 2002
- The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can HelpAlgorithmica, 2002
- Optimization by Simulated AnnealingScience, 1983
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A Theorem on Boolean MatricesJournal of the ACM, 1962