Genetic algorithms for graph layouts with geometric constraints

In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layouts and explore the potential contribution of the genetic algorithms for this particular problem. Given a weighted graph, we want to find a geometric position of every vertex (layout) consistent with the weights in the graph. Among the possible solutions to this problem, we would also like to find one that follows a particular given shape or has some geometric properties. Our paper shows that the genetic algorithm can help improve the quality of the solution based on the geometric criteria and not only on precision.