Loading...

An ACO algorithm for the graph coloring problem [electronic resource]

Salari, M. (Majid) ; Sharif University of Technology

640 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CIMA.2005.1662331
  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. Ant colony optimization ; Frequency ; Genetic algorithms ; Industrial engineering ; Iterative algorithms ; Partitioning algorithms ; Remuneration ; Scheduling ; Simulated annealing ; System testing
  7. Source: Computational Intelligence Methods and Applications, ICSC Congress on ; 2005
  8. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1662331&queryText%3DAn+ACO+algorithm+for+the+graph+coloring+problem