Genetic algorithm encoding representations for graph partitioning problems

Abstract

This paper presents an insight on genetic algorithm (GA) encoding representations applied to graph partitioning problems. Redundancy and blindness, two important features that have a direct impact on the performance of the method, are theoretically investigated and some conclusions are drawn.