An ant-based algorithm for coloring graphs

Discrete Applied Mathematics

Volumn 156, Issue 2, 2008, Pages 190-200

  Bui, Thang N ^a   Nguyen, ThanhVu H ^a   Patel, Chirag M ^b   Phan, Kim Anh T ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Transfer Technology Inc   (United States)

^c Mekong Tech LLC   (United States)

Author keywords

Ant based algorithm; Graph coloring

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; INFORMATION USE; PROBLEM SOLVING; STATISTICAL METHODS;

ANT BASED ALGORITHM; GRAPH COLORING; STANDARD DEVIATIONS;

GRAPH THEORY;

EID: 37149033990     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.012     Document Type: Article

References (25)

1. Abril J., Comellas F., Cortes A., Ozon J., and Vaquer M. A multi-agent system for frequency assignment in cellular radio networks. IEEE Trans. Vehicular Technol. 49 5 (2000) 1558-1564
2. Bellare M., Goldreich O., and Sudan M. Free bits, PCPs and non-approximability-towards tight results. SIAM J. Comput. 27 (1998) 804-915
3. Bonabeau E., Dorigo M., and Theraulaz G. Inspiration for optimization from social insect behavior. Nature 406 (2000) 39-42
4. Brelaz D. New methods to color the vertices of a graph. Commun. ACM 22 4 (1979) 251-256
5. T.N. Bui, C. Patel, An ant system algorithm for coloring graphs, in: Computational Symposium on Graph Coloring and Its Generalizations, COLOR02, Cornell University, 2002.
6. M. Chiarandini, T. Stutzle, An application of iterated local search to graph coloring problem, in: Computational Symposium on Graph Coloring and Its Generalizations, COLOR02, Cornell University, 2002.
7. Comellas F., and Ozon J. Graph coloring algorithms for assignment problems in radio networks. Appl. Neural Networks Telecommun. 2 (1995) 49-56
8. F. Comellas, J. Ozon, An ant algorithm for the graph coloring problem, in: ANTS'98-From Ant Colonies to Artificial Ants: First International Workshop on Ant Colony Optimization, Brussels, Belgium, 1998.
9. C. Coritoru, H. Luchian, O. Gheorghies, A. Apetrei, A new genetic graph coloring heuristic, in: Computational Symposium on Graph Coloring and Its Generalizations, COLOR02, Cornell University, 2002.
10. Costa D., and Hertz A. Ants can colour graphs. J. Oper. Res. Soc. 48 (1997) 295-305
11. J. Culberson, F. Luo, Exploring the k-colorable landscape with iterated greedy, Cliques, Coloring and Satisfiability-Second DIMACS Implementation Challenge 1993, American Mathematical Society, vol. 26, 1996, pp. 245-284.
12. Dorigo M., and Di Caro G. The ant colony optimization meta-heuristic, New Ideas in Optimization (1999), McGraw-Hill, New York pp. 11-32
13. Dorigo M., and Gambardella L. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1 1 (1997) 53-66
14. Fleurent C., and Ferland J. Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63 (1996) 437-461
15. Galinier P., and Hao J. Hybrid evolutionary algorithms for graph coloring. J. Combin. Optimization 3 4 (1998) 379-397
16. Gambardella L.M., and Dorigo M. An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS J. Comput. 12 3 (2000) 237-255
17. F. Glover, M. Parker, J. Ryan, Coloring by tabu branch and bound, Cliques, Coloring and Satisfiability-Second DIMACS Implementation Challenge 1993, American Mathematical Society, vol. 26, 1996, pp. 285-307.
18. Halldórsson M.M. A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45 (1993) 19-23
19. Hertz A., and Werra D. Using tabu search techniques for graph coloring. Computing 39 (1987) 345-351
20. Johnson D.S., Aragon C., McGeoch L., and Schevon C. Optimization by simulated annealing: an experimental evaluation; Part II, Graph coloring and number partitioning. Oper. Res. 39 3 (1991) 378-406
21. D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability-Second DIMACS Implementation Challenge 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, 1996.
22. Leighton F.T. A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bureau Standards 84 6 (1979) 489-506
23. Maniezzo V., and Carbonaro A. Ant colony optimization: an overview. In: Ribeiro C. (Ed). Essays and Surveys in Metaheuristics (2001), Kluwer, Dordrecht 21-44
24. C. Morgenstern, Distributed coloration neighborhood Search, in: Cliques, Coloring and Satisfiability-Second DIMACS Implementation Challenge 1993, American Mathematical Society, vol. 26, 1996, pp. 335-358.
25. T. White, B. Pagurek, F. Oppacher, ASGA: improving the ant system by integration with genetic algorithms, in: Proceedings of the Third Conference on Genetic Programming (GP/SGA 98), 1998, pp. 610-617.