Faster evolutionary algorithms by superior graph representation

Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007

Volumn , Issue , 2007, Pages 245-250

  Doerr, Benjamin ^a   Klein, Christian ^a   Storch, Tobias ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; PROBLEM SOLVING;

CYCLIC PERMUTATIONS; EULERIAN CYCLE PROBLEM; INPUT GRAPHS;

EVOLUTIONARY ALGORITHMS;

EID: 34547394086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCI.2007.372176     Document Type: Conference Paper

References (13)

1. T. Bäck, D. Fogel, and Z. Michalewicz, Eds., Handbook of Evolutionary Computation. Oxford University Press, New York, and Institute of Physics Publishing, Bristol, 1997.
2. N. Christofides, "Worst-case analysis of a new heuristic for the travelling salesman problem," in Algorithms and complexity: New directions and recent results, J. Traub, Ed. Academic Press, Inc., 1976, p. 441.
3. B. Doerr, N. Hebbinghaus, and F. Neumann, "Speeding up evolutionary algorithms through restricted mutation operators," in Proceedings of the 9th International Conference on Parallel Problem Solving From Nature (PPSN), ser. Lecture Notes in Computer Science, vol. 4193. Springer, 2006, pp. 978-987.
4. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1+1) evolutionary algorithm," Theoretical Computer Science, vol. 276, pp. 51-81, 2002.
5. J. Edmonds and E. L. Johnson, "Matching, euler tours and the Chinese postman," Mathematical Programming, vol. 5, pp. 88-124, 1973.
6. L. Euler, "Solutio problematic ad geometriam situs pertinentis," Commentarii academiae scientiarum Petropolitanae, vol. 8, pp. 128-140, 1741.
7. C. Hierholzer, "Ueber die Möglichkeit, einen Linenzug ohne Wiederholung und ohne Unterbrechung zu umfahren," Mathematische Annalen, vol. 6, pp. 30-32, 1873.
8. P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, "Genetic algorithms for the travelling salesman problem: A review of representations and operators," Artificial Intelligence Review, vol. 13, pp. 129-170, 1999.
9. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
10. F. Neumann, "Expected runtimes of evolutionary algorithms for the Eulerian cycle problem," in Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC). IEEE Press, 2004, pp. 904-910.
11. F. Neumann and I. Wegener, "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem," in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), ser. Lecture Notes in Computer Science, vol. 3102. Springer, 2004, pp. 713-724.
12. G. R. Raidl and B. A. Julstrom, "Edge sets: an effective evolutionary coding of spanning trees." IEEE Trans. Evolutionary Computation, vol. 7, pp. 225-239, 2003.
13. C. Witt, "Worst-case and average-case approximations by simple randomized search heuristics," in Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), ser. Lecture Notes in Computer Science, vol. 3404. Springer, 2005, pp. 44-56.