Edge-based representation beats vertex-based representation in shortest path problems
Benjamin Doerr, Daniel Johannsen · 2010
In this paper, we present a new representation for individuals in the single-source shortest path problem. Contrary to previous approaches, it has the natural property that different vertex degrees do not induce unfairness in the mutation step. In particular, at any time each edge has roughly the same probability of being added to or removed from the current individual.