Modified Ant Colony System for coloring graphs

Abstract

Ant Colony System (ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign different colors for adjacency node (vi, vj). This paper introduces ANTCOL algorithm to solve solution by Ant Colony System algorithm that is not known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, it will be shown the way how to apply ACS to solve ATP. We propose ANT XRLF method which uses XRLF to solve ANTCOL. Graph coloring result and execution time of our method are compared with existent generating functions (ANT Random, ANTLF, ANT-SL, ANTJDSATUR, ANT-RLF method) Also we compare with existent generating functions with the method ANT XRLF (ANTXRLFR) where re-search is added.