An Ant Colony Optimization algorithm for the minimum weight vertex cover problem

An Ant Colony Optimization algorithm for the minimum weight vertex cover problem

0.00 Avg rating0 Votes
Article ID: iaor20051176
Country: Netherlands
Volume: 131
Issue: 1
Start Page Number: 283
End Page Number: 304
Publication Date: Oct 2004
Journal: Annals of Operations Research
Authors: , ,
Keywords: graphs, heuristics
Abstract:

Given an undirected graph and a weighting function defined on the vertex set, the minimum weight vertex cover problem is to find a vertex subset whose total weight is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we introduce a metaheuristic based upon the Ant Colony Optimization (ACO) approach, to find approximate solutions to the minimum weight vertex cover problem. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. A solution to the minimum weight vertex cover problem however needs not to constitute a path. The ACO algorithm proposed in this paper incorporates several new features so as to select vertices out of the vertex set whereas the total weight can be minimized as much as possible. Computational experiments are designed and conducted to study the performance of our proposed approach. Numerical results evince that the ACO algorithm demonstrates significant effectiveness and robustness in solving the minimum weight vertex cover problem.

Reviews

Required fields are marked *. Your email address will not be published.