Scatter search for graph coloring

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

Volumn 2310, Issue , 2002, Pages 168-179

  Hamiez, Jean Philippe ^a   Hao, Jin Kao ^b  

^a ECOLE DES MINES D ALÈS   (France)

^b UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; EVOLUTIONARY STRATEGIES; GRAPH COLORING PROBLEM; GRAPH COLORINGS; SCATTER SEARCH;

GRAPH THEORY;

EID: 84959045917     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46033-0_14     Document Type: Conference Paper

References (27)

1. Brélaz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4) (1979) 251–256
2. Culberson, J.: Bibliography on graph coloring. Available on the wold wide web at http://liinwww.ira.uka.de/bibliography/Theory/graph.coloring.html (2000)
3. Dorne, R., Hao, J.K.: Tabu search for graph coloring, T-colorings and set T-colorings. In Voss, S., Martello, S., Osman, I.H., Roucairol, C. (editors) Meta-heuristics: advances and trends in local search paradigms for optimization KluwerAcademic Publishers (1998) 77-92
4. Dorne, R., Hao, J.K.: A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Science 1498 Springer-Verlag (1998) 745–754
5. Dubois, N., de Werra, D.: EPCOT: an efficient procedure for coloring optimally with tabu search. Computers Math. Appl. 25(10/11) (1993) 35–45
6. Ferland, J.A., Fleurent, C.: Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In [19] (1996) 619–652
7. Funabiki, N., Higashino, T.: A minimal-state processing search algorithm for graph colorings problems. IEICE Trans. Fundamentals E83–A (7) (2000) 1420–1430
8. Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. J. Combin Optim. 3(4) (1999) 379–397
9. Gamst, A.: Some lower bounds for a class of frequency assignment problems. IEEE Trans. Veh. Tech. 35(1) (1986) 8–14
10. Glover, F.: A template for scatter search and path relinking. In Hao, J.K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (editors) Artificial evolution. Lecture Notes in Computer Science 1363 Springer-Verlag (1998) 13–54
11. Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. Tech. Report (February 2001)
12. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1997)
13. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics 39(3) (2000) 653–684
14. Glover, F., Laguna, M., Martí, R.: Scatter search. In Ghosh, A., Tsutsui, S. (editors) Theory and applications of evolutionary computation: recent trends Springer Verlag (to appear)
15. Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45 (1993) 19–23
16. Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39 (1987) 345–351
17. Jagota, A.: An adaptive, multiple restarts neural network algorithm for graph coloring. European J. Oper. Res. 93 (1996) 257–270
18. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation. II. Graph coloring and number partitioning. Oper. Res. 39(3) (1991) 378–406
19. Johnson, D.S., Trick, M.A. (editors): Cliques, coloring, and satisfiability: 2nd DIMACS implementation challenge, 1993. DIMACS Series in Discr. Math. and Theoretical Comput. Sci. 26 American Math. Soc. (1996)
20. Karp, R.M.: Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W. (editors) Complexity of computer computations Plenum Press, New York (1972) 85–103
21. Laguna, M.: Scatter search. In Pardalos, P.M., Resende, M.G.C. (editors) Handbook of applied optimization Oxford Academic Press (to appear)
22. Laguna, M., Armento, V.A.: Lessons from applying and experimenting with scatter search. Tech. Report (March 2001)
23. Laguna, M., Martí, R.: Experimental testing of advanced scatter search designs for global optimization of multimodal functions. Tech. Report (August 2000)
24. Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bur. Stand. 84 (1979) 489–506
25. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems Proc. 25th Annual ACM Symp. Theory of Comput. (1993) 286–293
26. Morgenstern, C.A.: Distributed coloration neighborhood search. In [19] (1996) 335–357
27. Rego, C.: Integrating advanced principles of tabu search for the vehicle routing problem. Working paper, Faculty of Sciences, University of Lisbon (1999)