We propose and analyze a novel genotype to represent walk and cycle covers in graphs, namely matchings in the adjacency lists. This representation admits the natural mutation operator of adding a random match and possibly also matching the former partners.
To demonstrate the strength of this set-up, we use it to build a simple (1+1) evolutionary algorithm for the problem of finding an Eulerian cycle in a graph. We analyze several natural variants that stem from different ways to randomly choose the new match.
Among other insight, we exhibit a (1+1) evolutionary algorithm that computes an Euler tour in a graph with $m$ edges in expected optimization time Θ(m log m). This significantly improves the previous best evolutionary solution having expected optimization time Θ(m2 log m) in the worst-case, but also compares nicely with the runtime of an optimal classical algorithm which is of order Θ(m). A simple coupon collector argument indicates that our optimization time is asymptotically optimal for any randomized search heuristic.
[1]
Benjamin Doerr,et al.
Faster Evolutionary Algorithms by Superior Graph Representation
,
2007,
2007 IEEE Symposium on Foundations of Computational Intelligence.
[2]
C. Hierholzer,et al.
Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren
,
1873
.
[3]
Frank Neumann.
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
,
2004,
IEEE Congress on Evolutionary Computation.
[4]
Frank Neumann,et al.
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
,
2006,
PPSN.
[5]
Jack Edmonds,et al.
Matching, Euler tours and the Chinese postman
,
1973,
Math. Program..