Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem

Broderick Crawford; Ricardo Soto; Rodrigo Cuesta; Fernando Paredes

doi:10.1007/978-3-319-07857-1_86

Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem

Broderick Crawford, Ricardo Soto, Rodrigo Cuesta, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

Abstract

The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.

Original language	English
Title of host publication	HCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
Publisher	Springer Verlag
Pages	493-497
Number of pages	5
ISBN (Print)	9783319078564
DOIs	https://doi.org/10.1007/978-3-319-07857-1_86
State	Published - 2014

Publication series

Name	Communications in Computer and Information Science
Volume	434 PART I
ISSN (Print)	1865-0929

Keywords

Artificial Bee Colony Algorithm
Swarm Intelligence
Weighted Set Covering Problem

Access to Document

10.1007/978-3-319-07857-1_86

Cite this

Crawford, B., Soto, R., Cuesta, R., & Paredes, F. (2014). Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem. In HCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings (pp. 493-497). (Communications in Computer and Information Science; Vol. 434 PART I). Springer Verlag. https://doi.org/10.1007/978-3-319-07857-1_86

@inproceedings{4a0ed181ff524b98831b4d089570569a,

title = "Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem",

abstract = "The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.",

keywords = "Artificial Bee Colony Algorithm, Swarm Intelligence, Weighted Set Covering Problem",

author = "Broderick Crawford and Ricardo Soto and Rodrigo Cuesta and Fernando Paredes",

year = "2014",

doi = "10.1007/978-3-319-07857-1_86",

language = "English",

isbn = "9783319078564",

series = "Communications in Computer and Information Science",

publisher = "Springer Verlag",

pages = "493--497",

booktitle = "HCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings",

}

Crawford, B , Soto, R, Cuesta, R & Paredes, F 2014, Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem. in HCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings. Communications in Computer and Information Science, vol. 434 PART I, Springer Verlag, pp. 493-497. https://doi.org/10.1007/978-3-319-07857-1_86

Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem. / Crawford, Broderick ; Soto, Ricardo; Cuesta, Rodrigo et al.
HCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings. Springer Verlag, 2014. p. 493-497 (Communications in Computer and Information Science; Vol. 434 PART I).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Cuesta, Rodrigo

AU - Paredes, Fernando

PY - 2014

Y1 - 2014

N2 - The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.

AB - The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.

KW - Artificial Bee Colony Algorithm

KW - Swarm Intelligence

KW - Weighted Set Covering Problem

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

U2 - 10.1007/978-3-319-07857-1_86

DO - 10.1007/978-3-319-07857-1_86

M3 - Conference contribution

AN - SCOPUS:84903521541

SN - 9783319078564

T3 - Communications in Computer and Information Science

SP - 493

EP - 497

BT - HCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings

PB - Springer Verlag

ER -

Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this