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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 8th WSEAS Int. Conf. on ARTIFICIAL INTELLIGENCE, KNOWLEDGE ENGINEERING & DATA BASES (AIKED '09) |
| Publication status | Published - 2009 |
| Externally published | Yes |