Modified Ant Colony System for coloring graphs

ICICS-PCM 2003 - Proceedings of the 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia

Volumn 3, Issue , 2003, Pages 1849-1853

  Ahn, SangHyuck ^a   Lee, SeungGwan ^a   Chung, TaeChoong ^a  

^a Kyung Hee University   (South Korea)

Author keywords

Ant Colony System (ACS); Assignment type problem (ATP); Graph coloring

Indexed keywords

ALGORITHMS; ANT COLONY OPTIMIZATION; COLORING; FEEDBACK; MULTIMEDIA SIGNAL PROCESSING; OPTIMIZATION; SIGNAL PROCESSING;

ANT COLONY SYSTEM ALGORITHMS; ANT COLONY SYSTEMS; ASSIGNMENT TYPE PROBLEM (ATP); COMBINATIONAL OPTIMIZATION; GENERATING FUNCTIONS; GRAPH COLORING PROBLEM; GRAPH COLORINGS; OPTIMAL SOLUTIONS;

GRAPH THEORY;

EID: 35348995290     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICS.2003.1292787     Document Type: Conference Paper

References (12)

1. Colorni A, Dorigo M, Maniezzo V "Distributed optimization by ant colonies" Proceeding of the first European Conference on Artificial Life. Paris, MIT Press Bradford Books, Cambridge pp.134-142 (1991)
2. Colorni A, Dorigo M, Maniezzo V "An investigation of some properties of an ant algorithm" Proceeding of the Second Conference on Parali Problem Solving from Nature. Brussels, North-Holland, Amsterdam pp. 509-520 (1992)
3. Maniezzo V, Colorni A, Dorigo M "The ant system applied to the quadratic assignment problem" IRID1A, Université Libre de Bruxelles, Belgium (1994)
4. Colorni A, Dorigo M, Maniezzo V "Ant System for job shop scheduling" Belgian J Opns Res. Stat and Comp Sci Vol 34. pp.39-53 (1994)
5. Dorigo M, Maniezzo V, Colorni A "The ant system: optimization by a colony of cooperation agents", IEEE Transactions of Systems, Man and Cybernetics-Part B, vol. 26, no. 2, pp. 29-41 (1996)
6. Ferland J A, Hertz A and Lavoie A "An object oriented methodology for solving assignment type problem with neighborhood search techniques" Opns Res Vol 44. pp.347-359(1996)
7. D. Costa and Hertz A, "Ant can colour graphs", J. Op. Res. Society, pp. 295-305 (1997)
8. Welsh D. J. A and M B. Powell "An Upper Bound for Chromatic Number of a Graph and its Application to Timetabling Problems" Comput. J. vol.10 pp.85-86 (1967)
9. Manila D. W, G Marble and J .D. Issacson "Graph Coloring Algorithms" on Graph Theory and Computing, R. C. Read, Academic Press, New York, pp.104-122 (1972)
10. Bralaz D "New methods to color vertices of a graph" Communications of the ACM Vol 22 pp. 251-256 (1979).
11. Leighton F"A graph coloring algorithm for large scheduling problems" J. National Bureau of Standards Vol 84pp.489-505(1979)
12. Johnson D. S, Aragon C. A, "Optimization by Simulated Annealing: An Experimental Evaluation-Part2 (Graph Coloring and Number partitioning)", Operations Research, vol. 31, pp.378-406 (1991)