Future Generation Computer Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Ant Colony Optimization Heuristic for Solving Maximum Independent Set Problems
ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
WSEAS Transactions on Computers
Searching for maximum cliques with ant colony optimization
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
An ant colony optimization (ACO) algorithm solution to economic load dispatch (ELD) problem
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A tool for comparing resource-constrained project scheduling problem algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
WSEAS Transactions on Computers
WSEAS TRANSACTIONS on COMMUNICATIONS
Artificial bee colony algorithm for the capacitated vehicle routing problem
ECC'11 Proceedings of the 5th European conference on European computing conference
| Hi-index | 0.00 |
Ant colony optimization (ACO) has previously been applied to the Minimum Weight Vertex Cover Problem with very good results. The performance of the ACO algorithm can be improved with the use of different variations of the basic Ant Colony System algorithm, like the use of Elitism, Rank based approach and the MinMax system. In this paper, we have made an analysis of effectiveness of these variations applied to the Minimum Weight Vertex Covering Problem for different problem cases. This analysis is done by the observation of several properties of acquired solutions by these algorithms like best found solution, average solution quality, dispersion and distribution of solutions.