Ant colony system for graph coloring problem

Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet

Volumn 1, Issue , 2005, Pages 786-791

  Bessedik, Malika ^a   Laib, Rafik ^a   Boulmerka, Aissa ^a   Drias, Habiba ^a  

^a Institut National de Formation en Informatique   (Algeria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; ITERATIVE METHODS; ONLINE SEARCHING; OPERATIONS RESEARCH;

ANT COLONY SYSTEM (ACS); DIMACS GRAPHS; GRAPH COLOURING PROBLEM (GCP); PHEROMONE;

GRAPHIC METHODS;

EID: 33847206802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. M.R. GAREY, D.S. JOHNSON, Computers and intractability: a guide to the theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
2. D.BRÉLAZ,New methods to color vertices of a graph. Communications of ACM 22: 251-256, 1979.
3. A. HERTZ, D. De WERRA, Using Tabu search techniques for graph coloring. Computing 39 : 345-351, 1987.
4. M. CHAMS, A. HERTZ, D. de WERRA, Some experiments with simulated annealing for coloring graphs. EJOR 32 : 260-266, 1987.
5. C. FLEURENT, J.A. FERLAND, Genetic and hybrid algorithms for graph coloring. Dans G. Laporte, T.H. Osman, (Eds.), Metaheuristics in Combinatorial Optimization, Annals of Operations Research, 63 : 437-441, 1996.
6. J-P. HAMIEZ AND J.K. HAO, Scatter Search For graph coloring, Lecture Notes in Computer Science 2310: 168-179, Springer, 2002.
7. M. DORIGO, V. MANIEZZO, and A. COLORNI. The ant system: An Autocatalytic optimizing process. Technical Report 91-016 Revised.
8. P. GALINIER. Hybrid Evolutionary Algorithms for graph coloring. J.Combin. Optim. 3(4) (1999) 379-397.
9. R. DORNE, J.K, HAO, A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Science 1498 : 745-754, Springer-Verlag, 1998.
10. F. COMELLAS AND J. OZAN, Ant Algorithms for Discrete Optimization in D. Corne, M. Dorigo and F. Glover editors, New ideas in Opt pages 11-32 Mc Graw Hill London. UK, 1999.
11. M.DORIGO, G. DI CARO AND L.M. GAMBARDELLA., Ant algorithms for discrete mathematics. Artifitial life, 5(2): 137-172, 1999.
12. M. DORIGO, Ant Colonies for the Travelling Salesman Problem. Bio systems, 43:73-81, 1997.
13. D. COSTA, A. HERTZ, Ants Can Colour Graphs, The journal of the operational Research Society. (1997)
14. D.S. JOHNSON, M.A. TRICK (Eds.), 2nd DIMACS implementation challenge -cliques, coloring and satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, American Mathematical Society, 1996.