A hybrid Ant algorithm for the set covering problem

Broderick Crawford; Ricardo Soto; Eric Monfroy; Fernando Paredes; Wenceslao Palma

A hybrid Ant algorithm for the set covering problem

Broderick Crawford, Ricardo Soto, Eric Monfroy, Fernando Paredes, Wenceslao Palma

SCHOOL OF COMPUTER ENGINEERING

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.

Original language	English
Pages (from-to)	4667-4673
Number of pages	7
Journal	International Journal of Physical Sciences
Volume	6
Issue number	19
State	Published - 16 Sep 2011

Keywords

Ant colony optimization
Look-ahead techniques
Set covering problem

Cite this

@article{64aa41741215406dba95b4cd9b72c6cc,

title = "A hybrid Ant algorithm for the set covering problem",

abstract = "Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.",

keywords = "Ant colony optimization, Look-ahead techniques, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and Eric Monfroy and Fernando Paredes and Wenceslao Palma",

year = "2011",

month = sep,

day = "16",

language = "English",

volume = "6",

pages = "4667--4673",

journal = "International Journal of Physical Sciences",

issn = "1992-1950",

publisher = "Academic Journals",

number = "19",

}

TY - JOUR

T1 - A hybrid Ant algorithm for the set covering problem

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Monfroy, Eric

AU - Paredes, Fernando

AU - Palma, Wenceslao

PY - 2011/9/16

Y1 - 2011/9/16

N2 - Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.

AB - Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.

KW - Ant colony optimization

KW - Look-ahead techniques

KW - Set covering problem

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

M3 - Article

AN - SCOPUS:80053070769

SN - 1992-1950

VL - 6

SP - 4667

EP - 4673

JO - International Journal of Physical Sciences

JF - International Journal of Physical Sciences

IS - 19

ER -

A hybrid Ant algorithm for the set covering problem

Abstract

Keywords

Other files and links

Fingerprint

Cite this