Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

Computers and Operations Research

Volumn 35, Issue 9, 2008, Pages 2750-2759

  Neumann, Frank ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Combinatorial optimization; Eulerian cycles; Evolutionary computations; Expected optimization time

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RANDOM PROCESSES;

EULERIAN CYCLES; EVOLUTIONARY COMPUTATIONS; EXPECTED OPTIMIZATION TIME;

EVOLUTIONARY ALGORITHMS;

EID: 38849207510     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.009     Document Type: Article

References (13)

1. Papadimitriou C.H., Schäffer A.A., and Yannakakis M. On the complexity of local search. Proceedings of 22nd ACM symposium on theory of computing (STOC) (1990) 438-445
2. Droste S., Jansen T., and Wegener I. On the analysis of the (1 + 1) evolutionary algorithm. Theoretical Computer Science 276 (2002) 51-81
3. Scharnow J, Tinnefeld K, Wegener I. Fitness landscapes based on sorting and shortest paths problems. Proceeding of parallel problem solving from nature-PPSN VII, 2002, Lecture notes in computer science, vol. 2939, p. 54-63.
4. Neumann F., and Wegener I. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In: Deb, et al. (Ed). Genetic and evolutionary computation conference-GECCO 2004. Lecture notes in computer science vol. 3102 (2004), Springer, Berlin 713-724
5. Neumann F., and Wegener I. Minimum spanning trees made easier via multi-objective optimization. In: Beyer, et al. (Ed). Genetic and evolutionary computation conference-GECCO 2005 vol. 1 (2005), ACM Press, New York 763-770
6. Giel O, Wegener I. Evolutionary algorithms and the maximum matching problem. Proceedings of 20th STACS, 2003. Lecture notes in computer science vol. 2607, p. 415-426.
7. Witt C. Worst-case and average-case approximations by simple randomized search heuristics. Proceedings of the 22nd annual symposium on theoretical aspects of computer science (STACS '05) Lecture notes in computer science vol. 3404 (2005), Springer, Berlin 44-56
8. Skiena S. Implementing discrete mathematics: combinatorics and graph theory with mathematica (1990), Addison-Wesley, Reading, MA
9. Hierholzer C. Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen 6 (1873) 30-32
10. Edmonds J., and Johnson E.L. Matching, Euler tours and the chinese postman. Mathematical Programming 5 (1973) 88-124
11. Lacomme P., Prins C., and Ramdane-Chérif W. A genetic algorithm for the capacitated arc routing problem and its extensions. Applications of evolutionary computing: proceedings of Evoworkshops (2001)
12. Michalewicz Z., and Fogel D.B. How to solve it (2000), Springer, Berlin
13. Jansen T., and Wegener I. Evolutionary algorithms-how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation 5 (2001) 589-599