Genetic algorithms in solving graph partitioning problem

The graph Partitioning Problem (GPP) is one of the fundamental multimodal combinatorial problems that has many applications in computer science. Many algorithms have been devised to obtain a reasonable approximate solution for the GP problem, this paper applies different Genetic Algorithms in solving GP problem. In addition to using the Simple Genetic Algorithm (SGA), it introduces a new genetic algorithm maned the Adaptive Population Genetic paper also presents a new approach using niching methods for solving GPP as a multimodal optimization problem. The paper also presents a comparison between the four genetic algorithms; Simple Genetic Algorithm (SGA), Adaptive Population Genetic Algorithm (APGA) and the two niching methods; Sharing and Deterministic Crowding, when applied to the graph partitioning problem. Results proved the superiority of APGA over SGA and the ability of niching methods in obtaining a set of multiple good solutions.