Loading...

An ACO algorithm for graph coloring problem

Salari, E ; Sharif University of Technology | 2005

210 Viewed
  1. Type of Document: Article
  2. Publisher: 2005
  3. Abstract:
  4. Ant Colony Optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to Max-Min Ant System structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem
  5. Keywords:
  6. Algorithms ; Graph theory ; Heuristic methods ; Problem solving ; Ant Colony Optimization (ACO) ; Graph coloring problem ; Metaheuristics ; Search heuristics ; Combinatorial optimization
  7. Source: 2005 ICSC Congress on Computational Intelligence Methods and Applications, Istanbul, 15 December 2005 through 17 December 2005 ; Volume 2005 , 2005 ; 1424400201 (ISBN); 9781424400201 (ISBN)
  8. URL: https://ieeexplore.ieee.org/document/1662331