A hybrid parallel genetic algorithm approach for graph coloring

Authors:
S. N. Sivanandam;S. Sumathi;T. Hamsapriya
Affiliations:
P.S.G College of Technology Coimbatore, Tamilnadu, India, 641004 (Corresponding author. E-mail: prish_67@yahoo.co.in);P.S.G College of Technology Coimbatore, Tamilnadu, India, 641004;P.S.G College of Technology Coimbatore, Tamilnadu, India, 641004
Venue:
International Journal of Knowledge-based and Intelligent Engineering Systems
Year:
2005

Citing 4
Cited 1

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Practical implementations and applications of graph coloring

Practical implementations and applications of graph coloring
New methods to color the vertices of a graph

Communications of the ACM

A genetic algorithm to minimize chromatic entropy

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is a well-known NP-hard problem. In this paper a new permutation based representation of graph coloring problem is solved using a parallel genetic algorithm (PGA). Migration model of parallelism is used with Message passing interface (MPI) for implementation of parallel genetic algorithm. Three-crossover operators namely greedy partition crossover (GPX), Uniform independent set crossover (UISX), and Permutation-based crossover (PX) are used. The performance of the three crossover operators is investigated in terms of convergence and execution time for standard benchmark graphs. The results show that GPX performs well in terms of convergence and PX in terms of execution time. The three crossover operators in parallel genetic algorithm outperform the serial genetic algorithm approximately by a factor of three. The paper is also validated with the static wavelength assignment problem in optical networks.