On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Fitness Landscapes Based on Sorting and Shortest Paths Problems
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
IEEE Transactions on Evolutionary Computation
Analysis of evolutionary algorithms for the longest common subsequence problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Simulated annealing, its parameter settings and the longest common subsequence problem
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
On the effects of adding objectives to plateau functions
IEEE Transactions on Evolutionary Computation
Computational complexity and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Analysis of (1+1) evolutionary algorithm and randomized local search with memory
Evolutionary Computation
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
| Hi-index | 0.01 |
Evolutionary algorithms are randomized search heuristics, which are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. They have successfully been applied to different kinds of arc routing problems. To start the analysis of evolutionary algorithms with respect to the expected optimization time on these problems, we consider the Eulerian cycle problem. We show that a variant of the well-known (1+1) EA working on the important encoding of permutations is able to find an Eulerian tour of an Eulerian graph in expected polynomial time. Altering the operator used for mutation in the considered algorithm, the expected optimization time changes from polynomial to exponential.