Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
A computational view of population genetics
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
Techniques for bounding the convergence rate of genetic algorithms
Random Structures & Algorithms
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
When Will a Genetic Algorithm Outperform Hill Climbing?
Proceedings of the 5th International Conference on Genetic Algorithms
Intelligent Packets For Dynamic Network Routing Using Distributed Genetic Algorithm
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Real royal road functions for constant population size
Theoretical Computer Science
Crossover is provably essential for the Ising model on trees
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Real royal road functions: where crossover provably is essential
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Adding more intelligence to the network routing problem: AntNet and Ga-agents
Applied Soft Computing
Simulated annealing beats metropolis in combinatorial optimization
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Ignoble Trails - Where Crossover Is Provably Harmful
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science
Improved analysis methods for crossover-based algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Fixed-parameter evolutionary algorithms and the vertex cover problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Approximating geometric crossover in semantic space
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Running Time Analysis of ACO Systems for Shortest Path Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Edge-based representation beats vertex-based representation in shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Ant colony optimization for stochastic shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Towards analyzing recombination operators in evolutionary search
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
More effective crossover operators for the all-pairs shortest path problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Black-box complexities of combinatorial problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Running time analysis of Ant Colony Optimization for shortest path problems
Journal of Discrete Algorithms
Reducing the arity in unbiased black-box complexity
Proceedings of the 14th annual conference on Genetic and evolutionary computation
On the analysis of the simple genetic algorithm
Proceedings of the 14th annual conference on Genetic and evolutionary computation
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
| Hi-index | 0.00 |
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a non-artificial problem.