Graph Based Evolutionary Algorithms: Producing Spanning Tree Individuals

This poster paper addresses drawbacks of the use of evolutionary algorithms to solve problems that are represented in a form of a graph with a spanning tree solution. The spanning trees are notoriously hard to cross and mutate. Commonly requiring special checking and correcting algorithms to be used. We propose a new structure which overcomes the problem by the means of a bijective mapping into another graph domain.