Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm

Journal of Combinatorial Optimization

Volumn 7, Issue 3, 2003, Pages 229-236

  Glass, Celia A ^a   Prügel Bennett, Adam ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Frequency assignment problem; heuristics: local search; Genetic algorithms; Graph theory: Chromatic number problem

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM NUMBER GENERATION;

CHROMATIC NUMBER PROBLEM; FREQUENCY ASSIGNMENT PROBLEM; LOCAL SEARCH;

GRAPH THEORY;

EID: 0344443738     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1027312403532     Document Type: Article

References (11)

1. G. Carpaneto and P. Toth, "Algorithm 548: Solution of the assignment problem," ACM Transactions of Mathematical Software, vol. 6, no. 1, pp. 104-111, 1980.
2. D. Costa, A. Hertz, and O. Dubuis, "Embedding a sequential procedure within an evolutionary algorithm for coloring problems," Journal of Heuristics, vol. 1, pp. 105-128, 1995.
3. D.S. David, 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, vol. 39, no. 3, pp. 378-406, 1991.
4. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
5. A. Eisenblätter and A. Koster, "FAP web - a website about frequency assignment problems," 2000. Available on the world wide web at http://fap.zib.de/
6. C. Fleurent and J.A. Ferland, "Genetic and hybrid algorithms for graph coloring," Annals of Operations Research, vol. 63, pp. 437-461, 1996.
7. P. Galinier and J.K. Hao, "Hybrid evolutionary algorithms for graph coloring," Journal of Combinatorial Optimization, vol. 3, no. 4, pp. 379-397, 1999.
8. C.A. Glass and A. Prügel-Bennett, "A polynomially searchable exponential neighbourhood for graph coloring," 1998. Available on the world wide web at http://www.bib.ecs.soton.ac.uk/cgi-bin/record/6935.
9. A. Hertz and D. De Werra, "Using tabu search techniques for graph coloring," Computing, vol. 39, pp. 345-351, 1987.
10. D.S. Johnson and M.A. Trick (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, 1996. Available via ftp from ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/.
11. C. Morgenstern, "Distributed coloration neighborhood search," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society, vol. 26, pp. 335-357, 1996.