An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Computers and Operations Research

Volumn 37, Issue 10, 2010, Pages 1822-1832

  Porumbel, Daniel Cosmin ^a,b   Hao, Jin Kao ^a   Kuntz, Pascale ^b  

^a UNIVERSITÉ D'ANGERS   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

Diversity control; Graph coloring; Memetic and hybrid algorithm; Multi parent crossover; Population management

Indexed keywords

DIVERSITY CONTROL; HYBRID ALGORITHMS; MEMETIC; MULTI-PARENT CROSSOVER; POPULATION MANAGEMENT;

GRAPH THEORY; MATHEMATICAL OPERATORS;

COLORING;

EID: 77649190616     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.01.015     Document Type: Article

References (43)

1. Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. European Journal of Operational Research 151 2 (2003) 379-388
2. Blöchliger I., and Zufferey N. A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers and Operations Research 35 3 (2008) 960-975
3. Chams M., Hertz A., and de Werra D. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research 32 2 (1987) 260-266
4. Chiarandini M., Dumitrescu I., and Stützle T. Stochastic local search algorithms for the graph colouring problem. In: Gonzalez T.F. (Ed). Handbook of approximation algorithms and metaheuristics (2007), Chapman & Hall, CRC, Boca Raton, FL, USA p. 63-1-17
5. Chiarandini M, Stützle T. An application of iterated local search to graph coloring. In: Johnson DS, et al., editors. Computational symposium on graph coloring and its generalizations; 2002. p. 112-25.
6. Christofides N. An algorithm for the chromatic number of a graph. The Computer Journal 14 1 (1971) 38-39
7. Costa D., Hertz A., and Dubuis C. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. Journal of Heuristics 1 1 (1995) 105-128
8. De Jong KA. An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor, MI, USA; 1975.
9. Deb K., Pratap A., Agarwal S., and Meyarivan T. A fast and elitist multiobjective genetic algorithm NSGA-ii. IEEE Transactions on Evolutionary Computation 6 2 (2002) 182-197
10. Dorne R, Hao JK. A new genetic local search algorithm for graph coloring. In: PPSN 98, Lecture notes in computer science, vol. 1498. Berlin: Springer; 1998. p. 745.
11. Dorne R., and Hao J.K. Tabu search for graph coloring, t-colorings and set t-colorings. In: Voss S. (Ed). Meta-heuristics advances and trends in local search paradigms for optimization (1998), Kluwer, Dordrecht 77-92
12. Falkenauer E. Genetic algorithms and grouping problems (1998), Wiley, New York, USA
13. Fleurent C, Ferland JA. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In: Cliques, coloring, and satisfiability second DIMACS implementation challenge [Johnson DS, Trick M. Cliques, coloring, and satisfiability second DIMACS implementation challenge, DIMACS series in discrete mathematics and theoretical computer science, vol. 26. American Mathematical Society; 1996], p. 619-52.
14. Freisleben B, Merz P. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: Proceedings of IEEE international conference on evolutionary computation, 1996. p. 616-21.
15. Galinier P., and Hao J.K. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3 4 (1999) 379-397
16. Galinier P., and Hertz A. A survey of local search methods for graph coloring. Computers and Operations Research 33 9 (2006) 2547-2562
17. Galinier P., Hertz A., and Zufferey N. An adaptive memory algorithm for the k-coloring problem. Discrete Applied Mathematics 156 2 (2008) 267-279
18. Glass C.A., and Pruegel-Bennett A. A polynomially searchable exponential neighbourhood for graph colouring. Journal of the Operational Research Society 56 3 (1996) 324-330
19. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Boston
20. Goldberg DE, Richardson J. Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the second international conference on genetic algorithms, Lawrence Erlbaum Associates; 1987. p. 41-9.
21. Gusfield D. Partition-distance a problem and class of perfect graphs arising in clustering. Information Processing Letters 82 3 (2002) 159-164
22. Hamiez JP, Hao JK. Scatter search for graph coloring. In: Artificial evolution. Lecture notes in computer science, vol. 2310. Berlin: Springer; 2001. p. 168-79.
23. Hertz A., Plumettaz A., and Zufferey N. Variable space search for graph coloring. Discrete Applied Mathematics 156 13 (2008) 2551-2560
24. Hertz A., and Werra D. Using tabu search techniques for graph coloring. Computing 39 4 (1987) 345-351
25. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing an experimental evaluation; part II, graph coloring and number partitioning. Operations Research 39 3 (1991) 378-406
26. Johnson DS, Trick M. cliques, coloring, and satisfiability second DIMACS implementation challenge. In: DIMACS series in discrete mathematics and theoretical computer science, vol. 26. American Mathematical Society; 1996.
27. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of computer computations (1972), Plenum Press, New York 85-103
28. Lü Z, Hao JK. A memetic algorithm for graph coloring. European Journal of Operational Research 2010;203(1):241-50.
29. Mahfoud SW. A comparison of parallel and sequential niching methods. In: Conference on genetic algorithms, 1995. p. 136-43.
30. Malaguti E., Monaci M., and Toth P. A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing 20 2 (2008) 302
31. Malaguti E., and Toth P. An evolutionary approach for bandwidth multicoloring problems. European Journal of Operational Research 189 3 (2008) 638-651
32. Malaguti E., and Toth P. A survey on vertex coloring problems. International Transactions on Operational Research 17 1 (2010) 1-34
33. Miller BL, Shaw MJ. Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: Proceedings of IEEE international conference on evolutionary computation, 1996. p. 786-91.
34. Morgenstern C. Distributed coloration neighborhood search. In: Cliques, coloring, and satisfiability second DIMACS implementation challenge [Johnson DS, Trick M. Cliques, coloring, and satisfiability second DIMACS implementation challenge, DIMACS series in discrete mathematics and theoretical computer science, vol. 26. American Mathematical Society; 1996], p. 335-58.
35. Porumbel C.D., Hao J.K., and Kuntz P. A search space "cartography" for guiding graph coloring heuristics. Computers and Operations Research 37 (2010) 769-778
36. Radcliffe N.J. The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence 10 4 (1994) 339-384
37. Reeves C.R. Genetic algorithms for the operations researcher. INFORMS Journal on Computing 9 3 (1997) 231-250
38. Smith R.E., Forrest S., and Perelson A.S. Searching for diverse, cooperative populations with genetic algorithms. Evolutionary Computation 1 2 (1993) 127-149
39. Sörensen K., and Sevaux M. MA|PM: memetic algorithms with population management. Computers and Operations Research 33 5 (2006) 1214-1225
40. Tagawa K, Kanesige K, Inoue K, Haneda H. Distance based hybrid genetic algorithm: an application for the graph coloring problem. In: Proceedings of the 1999 Congress on evolutionary computation, 1999. p. 2325-32.
41. Trick MA, Yildiz H. A large neighborhood search heuristic for graph coloring. In: CPAIOR 2007. Lecture notes in computer science, vol. 4510. Berlin: Springer; 2007. p. 346-60.
42. Ursem RK. Diversity-guided evolutionary algorithms. In: PPSN VII. Lecture notes in computer science, vol. 2439. Berlin: Springer; 2002. p. 462-71.
43. Welsh D.J.A., and Powell M.B. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 10 1 (1967) 85-86