A binary fruit fly optimization algorithm to solve the set covering problem

Broderick Crawford; Ricardo Soto; Claudio Torres-Rojas; Cristian Peña; Marco Riquelme-Leiva; Sanjay Misra; Franklin Johnson; Fernando Paredes

doi:10.1007/978-3-319-21410-832

A binary fruit fly optimization algorithm to solve the set covering problem

Broderick Crawford, Ricardo Soto, Claudio Torres-Rojas, Cristian Peña, Marco Riquelme-Leiva, Sanjay Misra, Franklin Johnson, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

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

16 Scopus citations

Abstract

The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings
Editors	Marina L. Gavrilova, Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Carmelo Torre, David Taniar, Bernady O. Apduhan, Ana Maria A.C. Rocha, Sanjay Misra
Publisher	Springer Verlag
Pages	411-420
Number of pages	10
ISBN (Print)	9783319214092
DOIs	https://doi.org/10.1007/978-3-319-21410-832
State	Published - 2015
Event	15th International Conference on Computational Science and Its Applications, ICCSA 2015 - Banff, Canada Duration: 22 Jun 2015 → 25 Jun 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9158
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Conference on Computational Science and Its Applications, ICCSA 2015
Country/Territory	Canada
City	Banff
Period	22/06/15 → 25/06/15

Keywords

Combinatorial optimization problem
Fruit Fly Optimization Algorithm
Metaheuristics
Set Covering Problem

Access to Document

10.1007/978-3-319-21410-832

Cite this

Crawford, B., Soto, R., Torres-Rojas, C., Peña, C., Riquelme-Leiva, M., Misra, S., Johnson, F., & Paredes, F. (2015). A binary fruit fly optimization algorithm to solve the set covering problem. In M. L. Gavrilova, O. Gervasi, B. Murgante, S. Misra, C. Torre, D. Taniar, B. O. Apduhan, A. M. A. C. Rocha, & S. Misra (Eds.), Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings (pp. 411-420). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9158). Springer Verlag. https://doi.org/10.1007/978-3-319-21410-832

Crawford, Broderick ; Soto, Ricardo ; Torres-Rojas, Claudio et al. / A binary fruit fly optimization algorithm to solve the set covering problem. Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. editor / Marina L. Gavrilova ; Osvaldo Gervasi ; Beniamino Murgante ; Sanjay Misra ; Carmelo Torre ; David Taniar ; Bernady O. Apduhan ; Ana Maria A.C. Rocha ; Sanjay Misra. Springer Verlag, 2015. pp. 411-420 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ce2cb1e4623840b7b61f8cc99f614a8d,

title = "A binary fruit fly optimization algorithm to solve the set covering problem",

abstract = "The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.",

keywords = "Combinatorial optimization problem, Fruit Fly Optimization Algorithm, Metaheuristics, Set Covering Problem",

author = "Broderick Crawford and Ricardo Soto and Claudio Torres-Rojas and Cristian Pe{\~n}a and Marco Riquelme-Leiva and Sanjay Misra and Franklin Johnson and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 15th International Conference on Computational Science and Its Applications, ICCSA 2015 ; Conference date: 22-06-2015 Through 25-06-2015",

year = "2015",

doi = "10.1007/978-3-319-21410-832",

language = "English",

isbn = "9783319214092",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "411--420",

editor = "Gavrilova, {Marina L.} and Osvaldo Gervasi and Beniamino Murgante and Sanjay Misra and Carmelo Torre and David Taniar and Apduhan, {Bernady O.} and Rocha, {Ana Maria A.C.} and Sanjay Misra",

booktitle = "Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings",

}

Crawford, B , Soto, R, Torres-Rojas, C, Peña, C, Riquelme-Leiva, M, Misra, S, Johnson, F & Paredes, F 2015, A binary fruit fly optimization algorithm to solve the set covering problem. in ML Gavrilova, O Gervasi, B Murgante, S Misra, C Torre, D Taniar, BO Apduhan, AMAC Rocha & S Misra (eds), Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9158, Springer Verlag, pp. 411-420, 15th International Conference on Computational Science and Its Applications, ICCSA 2015, Banff, Canada, 22/06/15. https://doi.org/10.1007/978-3-319-21410-832

A binary fruit fly optimization algorithm to solve the set covering problem. / Crawford, Broderick ; Soto, Ricardo; Torres-Rojas, Claudio et al.
Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. ed. / Marina L. Gavrilova; Osvaldo Gervasi; Beniamino Murgante; Sanjay Misra; Carmelo Torre; David Taniar; Bernady O. Apduhan; Ana Maria A.C. Rocha; Sanjay Misra. Springer Verlag, 2015. p. 411-420 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9158).

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

TY - GEN

T1 - A binary fruit fly optimization algorithm to solve the set covering problem

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Torres-Rojas, Claudio

AU - Peña, Cristian

AU - Riquelme-Leiva, Marco

AU - Misra, Sanjay

AU - Johnson, Franklin

AU - Paredes, Fernando

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.

AB - The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.

KW - Combinatorial optimization problem

KW - Fruit Fly Optimization Algorithm

KW - Metaheuristics

KW - Set Covering Problem

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

U2 - 10.1007/978-3-319-21410-832

DO - 10.1007/978-3-319-21410-832

M3 - Conference contribution

AN - SCOPUS:84948947184

SN - 9783319214092

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 411

EP - 420

BT - Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings

A2 - Gavrilova, Marina L.

A2 - Gervasi, Osvaldo

A2 - Murgante, Beniamino

A2 - Misra, Sanjay

A2 - Torre, Carmelo

A2 - Taniar, David

A2 - Apduhan, Bernady O.

A2 - Rocha, Ana Maria A.C.

A2 - Misra, Sanjay

PB - Springer Verlag

T2 - 15th International Conference on Computational Science and Its Applications, ICCSA 2015

Y2 - 22 June 2015 through 25 June 2015

ER -

Crawford B , Soto R, Torres-Rojas C, Peña C, Riquelme-Leiva M, Misra S et al. A binary fruit fly optimization algorithm to solve the set covering problem. In Gavrilova ML, Gervasi O, Murgante B, Misra S, Torre C, Taniar D, Apduhan BO, Rocha AMAC, Misra S, editors, Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. Springer Verlag. 2015. p. 411-420. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-21410-832

A binary fruit fly optimization algorithm to solve the set covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this