An Efficient EA with Multipoint Guided Crossover for Bi-objective Graph Coloring Problem

Graph Coloring Problem is a well-studied classical NP-hard combinatorial problem. Several well-known heuristics and evolutionary approaches exist to solve single-objective graph coloring problem. We have considered a bi-objective variant of graph coloring problem, in which the number of colors used and the corresponding penalty which is incurred due to coloring the end-points of an edge with same color, are simultaneously minimized. In this paper, we have presented an evolutionary approach with Multipoint Guided Crossover (MPGX) to minimize both objectives simultaneously. On applying proposed evolutionary algorithm over standard graph coloring problem instances, a guaranteed solution to the single-objective graph coloring problem is achieved. We have adapted a few well-known heuristics which are evolved for single-objective graph coloring problem to generate set of solutions for bi-objective graph coloring problem and obtained Pareto fronts. Empirical results show that proposed evolutionary algorithm with simple Multipoint Guided Crossover generates superior or (near-) equal solutions in comparison with the adapted heuristic solutions as well as with evolutionary algorithm solutions using a few crossover (Penalty-based Color Partitioning Crossover (PCPX) and Degree Based Crossover (DBX)) operators across entire Pareto front for considered bi-objective variant of graph coloring problem.

[1]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[2]  J. Zoeliner,et al.  A Breakthrough in Spectrum Conserving Frequency Assignment Technology , 1977, IEEE Transactions on Electromagnetic Compatibility.

[3]  Rolf Drechsler,et al.  Efficient Graph Coloring by Evolutionary Algorithms , 1999, Fuzzy Days.

[4]  Rajeev Kumar,et al.  Enhancing solution quality of the biobjective graph coloring problem using hybridization of EA: biobjective graph coloring problem , 2008, GECCO '08.

[5]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[6]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[7]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[8]  Paolo Dell'Olmo,et al.  Bounding vertex coloring by truncated multistage branch and bound , 2004 .

[9]  David Zuckerman.  Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..

[10]  Guolong Chen,et al.  A symmetry-breaking approach of the graph coloring problem with GAs , 2004, 8th International Conference on Computer Supported Cooperative Work in Design.

[11]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  Bernd Reusch.  Computational Intelligence, Theory and Applications , 1997 .

[14]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[15]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[16]  Michael Randolph Garey,et al.  An Application of Graph Coloring to Printed Circuit Testing (Working Paper) , 1975, FOCS 1975.

[17]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[18]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[19]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[20]  Hussein Al-Omari,et al.  New Graph Coloring Algorithms , 2006 .

[21]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[22]  Francis F. Martin,et al.  Computer modeling and simulation , 1968 .

[23]  Lixia Han,et al.  A Novel Bi-objective Genetic Algorithm for the Graph Coloring Problem , 2010, 2010 Second International Conference on Computer Modeling and Simulation.

[24]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[25]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[26]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..