Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem

Authors:
Raka Jovanovic;Milan Tuba;Dana Simian
Affiliations:
Institute of Physics, Belgrade, Serbia;Faculty of Computer Science, Megatrend University Belgrade, Serbia;Department of Computer Science, Lucian Blaga University of Sibiu, Romania
Venue:
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
Year:
2009

Citing 5
Cited 2

Parallel genetic algorithms for a hypercube

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Multi Colony Ant Algorithms

Journal of Heuristics
Parallelization Strategies for Ant Colony Optimization

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
An object-oriented framework with corresponding graphical user interface for developing ant colony optimization based algorithms

WSEAS Transactions on Computers
Parallel ant colony optimization for the traveling salesman problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence

A theoretical and empirical analysis of convergence related particle swarm optimization

WSEAS Transactions on Systems and Control
A survey on parallel ant colony optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze various parallel implementations of the Ant Colony Optimization (ACO) applied to the Minimum Weight Vertex Cover Problem (MWVCP). We investigated the ACO algorithms applied to the MWCVP before. Here, we observe the behavior of different parallel topologies and corresponding algorithms like fully connected, replace worst, ring and independent parallel runs. We also present a variation of the algorithm corresponding to the ring topology that maintains the diversity of the search, but still moves to areas with better solutions.