A comparative assessment of ant colony optimization algorithms for the minimum weight vertex cover problem

Authors:
Raka Jovanovic;Milan Tuba
Affiliations:
Institute of Physics Belgrade, Zemun, Serbia;Faculty of Computer Science, Megatrend University of Belgrade, Belgrade, Serbia
Venue:
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Year:
2009

Citing 2
Cited 2

MAX-MIN Ant system

Future Generation Computer Systems
An object-oriented framework with corresponding graphical user interface for developing ant colony optimization based algorithms

WSEAS Transactions on Computers

A tool for comparing resource-constrained project scheduling problem algorithms

AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Comparison of different topologies for island-based multi-colony ant algorithms for the minimum weight vertex cover problem

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze the application of the Ant Colony Optimization to the Minimum Weight Vertex Covering Problem. We use the software system that we developed and implemented different standard ACO algorithms to this problem: Ant Colony System, the use of Elitism, Rank based approach and the MinMax system. We have made a comparative assessment of the effectiveness of these algorithms to the Minimum Weight Vertex Covering Problem in different problem cases and shown that Elitist Ant System and MinMax Ant System give better solutions for larger test cases while run-times for all algorithms were similar.