An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem

Raka Jovanovic, Milan Tuba

Research output: Contribution to journalArticle

76 Citations (Scopus)

Abstract

The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem. Some kind of hybridization or exploitation of the knowledge about specific problem often greatly improves the performance of standard evolutionary algorithms. In this article we propose a pheromone correction heuristic strategy that uses information about the best-found solution to exclude suspicious elements from it. Elements are suspicious if they have some undesirable properties that make them unlikely members of the optimal solution. This hybridization improves pure ant colony optimization algorithm by avoiding early trapping in local convergence. We tested our algorithm on numerous test-cases that were used in the previous research of the same problem and our algorithm uniformly performed better, giving slightly better results in significantly shorter time.

Original languageEnglish
Pages (from-to)5360-5366
Number of pages7
JournalApplied Soft Computing Journal
Volume11
Issue number8
DOIs
Publication statusPublished - 1 Dec 2011
Externally publishedYes

Fingerprint

Ant colony optimization
Information use
Combinatorial optimization
Evolutionary algorithms
Computational complexity

Keywords

  • Ant colony optimization (ACO)
  • Combinatorial optimization
  • Minimum weight vertex cover problem (MWVCP)
  • Pheromone correction strategy

ASJC Scopus subject areas

  • Software

Cite this

An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. / Jovanovic, Raka; Tuba, Milan.

In: Applied Soft Computing Journal, Vol. 11, No. 8, 01.12.2011, p. 5360-5366.

Research output: Contribution to journalArticle

@article{e204a6511cf7442c8b176b3118e280e8,
title = "An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem",
abstract = "The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem. Some kind of hybridization or exploitation of the knowledge about specific problem often greatly improves the performance of standard evolutionary algorithms. In this article we propose a pheromone correction heuristic strategy that uses information about the best-found solution to exclude suspicious elements from it. Elements are suspicious if they have some undesirable properties that make them unlikely members of the optimal solution. This hybridization improves pure ant colony optimization algorithm by avoiding early trapping in local convergence. We tested our algorithm on numerous test-cases that were used in the previous research of the same problem and our algorithm uniformly performed better, giving slightly better results in significantly shorter time.",
keywords = "Ant colony optimization (ACO), Combinatorial optimization, Minimum weight vertex cover problem (MWVCP), Pheromone correction strategy",
author = "Raka Jovanovic and Milan Tuba",
year = "2011",
month = "12",
day = "1",
doi = "10.1016/j.asoc.2011.05.023",
language = "English",
volume = "11",
pages = "5360--5366",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",
number = "8",

}

TY - JOUR

T1 - An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem

AU - Jovanovic, Raka

AU - Tuba, Milan

PY - 2011/12/1

Y1 - 2011/12/1

N2 - The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem. Some kind of hybridization or exploitation of the knowledge about specific problem often greatly improves the performance of standard evolutionary algorithms. In this article we propose a pheromone correction heuristic strategy that uses information about the best-found solution to exclude suspicious elements from it. Elements are suspicious if they have some undesirable properties that make them unlikely members of the optimal solution. This hybridization improves pure ant colony optimization algorithm by avoiding early trapping in local convergence. We tested our algorithm on numerous test-cases that were used in the previous research of the same problem and our algorithm uniformly performed better, giving slightly better results in significantly shorter time.

AB - The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem. Some kind of hybridization or exploitation of the knowledge about specific problem often greatly improves the performance of standard evolutionary algorithms. In this article we propose a pheromone correction heuristic strategy that uses information about the best-found solution to exclude suspicious elements from it. Elements are suspicious if they have some undesirable properties that make them unlikely members of the optimal solution. This hybridization improves pure ant colony optimization algorithm by avoiding early trapping in local convergence. We tested our algorithm on numerous test-cases that were used in the previous research of the same problem and our algorithm uniformly performed better, giving slightly better results in significantly shorter time.

KW - Ant colony optimization (ACO)

KW - Combinatorial optimization

KW - Minimum weight vertex cover problem (MWVCP)

KW - Pheromone correction strategy

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

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

U2 - 10.1016/j.asoc.2011.05.023

DO - 10.1016/j.asoc.2011.05.023

M3 - Article

VL - 11

SP - 5360

EP - 5366

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

IS - 8

ER -