Sciweavers

Share
HEURISTICS
2006

A study of ACO capabilities for solving the maximum clique problem

8 years 11 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of pairwise adjacent vertices in a graph. We propose and compare two different instantiations of a generic ACO algorithm for this problem. Basically, the generic ACO algorithm successively generates maximal cliques through the repeated addition of vertices into partial cliques, and uses "pheromone trails" as a greedy heuristic to choose, at each step, the next vertex to enter the clique. The two instantiations differ in the way pheromone trails are laid and exploited, i.e., on edges or on vertices of the graph. We illustrate the behavior of the two ACO instantiations on a representative benchmark instance and we study the impact of pheromone on the solution process. We consider two measures --the re-sampling and the dispersion ratio-- for providing an insight into the performance at run time. We also s...
Christine Solnon, Serge Fenet
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where HEURISTICS
Authors Christine Solnon, Serge Fenet
Comments (0)
books