An evolutionary annealing approach to graph coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2037, Issue , 2001, Pages 120-129

  Fotakis, Dimitris A ^a   Likothanassis, Spiridon D ^a   Stefanakos, Stamatis K ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC ALGORITHMS; SIMULATED ANNEALING;

CROSSOVER OPERATOR; GRAPH COLORING PROBLEM; GRAPH COLORINGS;

EVOLUTIONARY ALGORITHMS;

EID: 34948901432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_13     Document Type: Conference Paper

References (18)

1. P.M Pardalos, T. Mavridou, and J. Xue. The graph coloring problem: A bibliographic survey. In D.-Z. Du and P.M. Pardalos, editors, Handbook of Combinatorial Optimization, Vol. 2, pages 331-395. Kluwer Academic Publishers, 1998.
2. F.T. Leighton. A graph colouring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84(6):489-503, 1979.
3. D. Brelaz. New methods to color the vertices of a graph. Communications of the ACM, 22(4):251-256, April 1979.
4. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial and Neural Computing. Interscience series in discrete mathematics and optimization. John Wiley & Sons, New York, 1989.
5. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13:533-549, 1986.
6. M. Chams, A. Hertz, and D. de Werra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research, 32(2):260-266, 1987.
7. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3):378-406, May-June 1991.
8. C.A. Morgenstern. Distributed coloration neighborhood search. In [17], pages 335-357. American Mathematical Society, 1996.
9. A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39(4):345-351, 1987.
10. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, NY, 1992.
11. C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, pages 437-461, 1995.
12. L. Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
13. D. Costa, A. Hertz, and O. Dubuis. Embedding a sequential procedure within an evolutionary algorithm for coloring problems. Journal of Heuristics, 1:105-128,1995.
14. P. Galinier and J.K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal ofCombinatorial Optimization, 1998.
15. R. Dorne and J.K. Hao. A new geneic local search algorithm for graph coloring,1998.
16. K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.
17. D.S. Johnson and M.A. Trick, editors. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996. contains many articles on cliques and coloring.
18. G. Lewandowski and A. Condon. Experiments with parallel graph coloring heuristics and applications of graph coloring. In [17], pages 309-334. American Mathematical Society, 1996.