An experimental investigation of iterated local search for coloring graphs

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

Volumn 2279 LNCS, Issue , 2002, Pages 122-131

  Paquete, Luis ^a   Stützle, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING; COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; CONSTRAINT SATISFACTION PROBLEMS; LOCAL SEARCH (OPTIMIZATION); SIGNAL PROCESSING; ALGORITHMS; OPTIMIZATION;

BENCHMARK SUITES; COMPUTATIONAL RESULTS; EXPERIMENTAL INVESTIGATIONS; GRAPH COLORING PROBLEM; ITERATED LOCAL SEARCH; LOCAL SEARCH ALGORITHM; OPTIMIZATION PROBLEMS; STRUCTURED GRAPHS;

GRAPH THEORY;

EID: 84878630426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46004-7_13     Document Type: Conference Paper

References (23)

1. M.W. Carter. A survey of pratical applications of examination timetabling algorithms. Operations Research, 34(2): 193-202, 1986.
2. D.J. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63: 301-320, 1996. (Pubitemid 126081080)
3. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, USA, 1979.
4. A. Mehrotra and M. Trick. A column generation approach for graph coloring. INFORMS Journal On Computing, 8(4): 344-354, 1996.
5. D. Brélaz. New methods to color the vertices of a graph. Communications of the ACM, 22(4): 251-256, 1979. (Pubitemid 9452014)
6. C. Fleurent and J. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63: 437-464, 1996. (Pubitemid 126081086)
7. P. Galinier and J.K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4): 379-397, 1999. (Pubitemid 129575323)
8. A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39: 345-351, 1987. (Pubitemid 18562739)
9. 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, 1991.
10. F.T. Leighton. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 85: 489-506, 1979.
11. H.R. Lourenço, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochen-berger, editors, Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, MA, USA, 2002. to appear.
12. J.C. Culberson. Iterated greedy graph coloring and the difficulty landscape. Technical Report 92-07, Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada, June 1992.
13. S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 52: 161-205, 1992.
14. R. Dorne and J.K. Hao. Tabu search for graph coloring, t-colorings and set t-colorings. In I.H. Osman S. Voss, S. Martello and C. Roucairol, editors, Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 77-92. Kluwer Academic Publishers, Boston, MA, USA, 1999.
15. M. Chams, A. Hertz, and D. De Werra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research, 32: 260-266, 1987. (Pubitemid 18516642)
16. L. Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of Genetic Algorithms, pages 72-90. Van Nostrand Reinhold; New York, 1991.
17. A.E. Eiben, J.K. Hauw, and J.I. Van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4: 25-46, 1998. (Pubitemid 128512786)
18. M. Laguna and R. Martí. A GRASP for coloring sparse graphs. Computational Optimization and Applications, 19(2): 165-178, 2001. (Pubitemid 32585286)
19. C. Fleurent and J. Ferland. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique and satisfiability. In D.S. Johnson and M.A. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACSImplementation Challenge, volume 26, pages 619-652. American Mathematical Society, 1996.
20. D.S. Johnson and L.A. McGeoch. The travelling salesman problem: A case study in local optimization. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215-310. John Wiley & Sons, Chichester, UK, 1997.
21. O. Martin and S.W. Otto. Partitoning ofunstructured meshes for load balancing. Concurrency: Practice and Experience, 7: 303-314, 1995.
22. H.H. Hoos and T. Stützle. Evaluating Las Vegas algorithms - pitfalls and remedies. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 238-245. Morgan Kaufmann, San Francisco, 1998.
23. H.H. Hoos and T. Stützle. Characterising the behaviour of stochastic local search. Artificial Intelligence, 112: 213-232, 1999.