A hybrid Multi-Objective Genetic Algorithm for Bandwidth Multi-Coloring Problem

Standard Genetic Algorithm (GA) yields poor performance on the Graph Coloring Problem (GCP) and its variants. This paper presents a Multi-Objective Genetic Algorithm (MOGA) for Bandwidth Multi-Coloring Problem (BMCP). The problem is a generalization of GCP. In the proposed method, genetic operations are replaced with new ones which suit better to the structure of the problem. Performance of this MOGA framework is further boosted by hybridizing it with a Local Search (LS) algorithm. The aim of this hybrid approach is to increase the variety within the population through the genetic operations and to improve those individuals further by using LS. Several tests were conducted on a collection of benchmarks from GEOM series and promising results are obtained.

[1]  Ender Özcan,et al.  Linear Linkage Encoding in Grouping Problems: Applications on Graph Coloring and Timetabling , 2006, PATAT.

[2]  Jin-Kao Hao,et al.  Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings , 1999 .

[3]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[4]  Steven David Prestwich,et al.  Generalised graph colouring by a hybrid of local search and constraint programming , 2008, Discret. Appl. Math..

[5]  Joshua D. Knowles,et al.  M-PAES: a memetic algorithm for multiobjective optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

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

[8]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[9]  Yi Zhu,et al.  Heuristic methods for graph coloring problems , 2005, SAC '05.

[10]  Paolo Toth,et al.  An evolutionary approach for bandwidth multicoloring problems , 2008, Eur. J. Oper. Res..

[11]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[12]  Yi Zhu,et al.  A Hybrid Method for the Graph Coloring and Related Problems , 2003 .

[13]  Jin-Kao Hao,et al.  Constraint Handling in Evolutionary Search: A Case Study of the Frequency Assignment , 1996, PPSN.

[14]  Nicolas Zufferey,et al.  Ant Local Search and its efficient adaptation to graph colouring , 2010, J. Oper. Res. Soc..

[15]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[16]  Emin Erkan Korkmaz,et al.  Multi-objective Genetic Algorithms for grouping problems , 2010, Applied Intelligence.

[17]  Szymon Lukasik,et al.  Parallel Simulated Annealing Algorithm for Graph Coloring Problem , 2007, PPAM.