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

Raka Jovanovic, Milan Tuba, Dana Simian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining
Pages254-259
Number of pages6
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event9th WSEAS International Conference on Simulation, Modelling and Optimization, SMO '09, Includes 5th WSEAS Int. Symp. Grid Computing, 5th WSEAS Int. Symp. Digital Libraries, 5th WSEAS Int. Symp. Data Mining and Intelligent Information Processing - Budapest, Hungary
Duration: 3 Sep 20095 Sep 2009

Other

Other9th WSEAS International Conference on Simulation, Modelling and Optimization, SMO '09, Includes 5th WSEAS Int. Symp. Grid Computing, 5th WSEAS Int. Symp. Digital Libraries, 5th WSEAS Int. Symp. Data Mining and Intelligent Information Processing
CountryHungary
CityBudapest
Period3/9/095/9/09

Fingerprint

Ant colony optimization
Topology

Keywords

  • Ant colony optimization
  • Combinatorial optimization
  • Minimum weight vertex cover
  • Parallel computing
  • Population based algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Software

Cite this

Jovanovic, R., Tuba, M., & Simian, D. (2009). Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem. In Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining (pp. 254-259)

Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem. / Jovanovic, Raka; Tuba, Milan; Simian, Dana.

Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining. 2009. p. 254-259.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jovanovic, R, Tuba, M & Simian, D 2009, Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem. in Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining. pp. 254-259, 9th WSEAS International Conference on Simulation, Modelling and Optimization, SMO '09, Includes 5th WSEAS Int. Symp. Grid Computing, 5th WSEAS Int. Symp. Digital Libraries, 5th WSEAS Int. Symp. Data Mining and Intelligent Information Processing, Budapest, Hungary, 3/9/09.
Jovanovic R, Tuba M, Simian D. Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem. In Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining. 2009. p. 254-259
Jovanovic, Raka ; Tuba, Milan ; Simian, Dana. / Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem. Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining. 2009. pp. 254-259
@inproceedings{8a429389d2684ea689427f22aaac8e42,
title = "Analysis of parallel implementations of the ant colony optimization applied to the minimum weight vertex cover problem",
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.",
keywords = "Ant colony optimization, Combinatorial optimization, Minimum weight vertex cover, Parallel computing, Population based algorithms",
author = "Raka Jovanovic and Milan Tuba and Dana Simian",
year = "2009",
month = "12",
day = "1",
language = "English",
isbn = "9789604741137",
pages = "254--259",
booktitle = "Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining",

}

TY - GEN

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

AU - Jovanovic, Raka

AU - Tuba, Milan

AU - Simian, Dana

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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.

AB - 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.

KW - Ant colony optimization

KW - Combinatorial optimization

KW - Minimum weight vertex cover

KW - Parallel computing

KW - Population based algorithms

UR - http://www.scopus.com/inward/record.url?scp=78149368189&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78149368189&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9789604741137

SP - 254

EP - 259

BT - Proc. 9th WSEAS Int. Conf. Simulation, Modelling and Optimization, SMO '09, 5th WSEAS Int. Symp. Grid Computing, Proc. 5th WSEAS Int. Symp. Digital Libraries, Proc. 5th WSEAS Int. Symp. Data Mining

ER -