A teaching-learning-based optimization algorithm for solving set covering problems

Broderick Crawford; Ricardo Soto; Felipe Aballay; Sanjay Misra; Franklin Johnson; Fernando Paredes

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

A teaching-learning-based optimization algorithm for solving set covering problems

Broderick Crawford, Ricardo Soto, Felipe Aballay, Sanjay Misra, Franklin Johnson, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

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

12 Scopus citations

Abstract

The Set Covering Problem (SCP) is a representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively.

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	421-430
Number of pages	10
ISBN (Print)	9783319214092
DOIs	https://doi.org/10.1007/978-3-319-21410-833
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
Metaheuristics
Set Covering Problem
Teaching-Learning-Based Optimization algorithm

Access to Document

10.1007/978-3-319-21410-833

Cite this

Crawford, B., Soto, R., Aballay, F., Misra, S., Johnson, F., & Paredes, F. (2015). A teaching-learning-based optimization algorithm for solving set covering problems. 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. 421-430). (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-833

Crawford, Broderick ; Soto, Ricardo ; Aballay, Felipe et al. / A teaching-learning-based optimization algorithm for solving set covering problems. 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. 421-430 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7fb707be1d9f462e82d5cbd7bce7b410,

title = "A teaching-learning-based optimization algorithm for solving set covering problems",

abstract = "The Set Covering Problem (SCP) is a representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively.",

keywords = "Combinatorial optimization, Metaheuristics, Set Covering Problem, Teaching-Learning-Based Optimization algorithm",

author = "Broderick Crawford and Ricardo Soto and Felipe Aballay 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-833",

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 = "421--430",

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, Aballay, F, Misra, S, Johnson, F & Paredes, F 2015, A teaching-learning-based optimization algorithm for solving set covering problems. 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. 421-430, 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-833

A teaching-learning-based optimization algorithm for solving set covering problems. / Crawford, Broderick ; Soto, Ricardo; Aballay, Felipe 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. 421-430 (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 teaching-learning-based optimization algorithm for solving set covering problems

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Aballay, Felipe

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 representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively.

AB - The Set Covering Problem (SCP) is a representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively.

KW - Combinatorial optimization

KW - Metaheuristics

KW - Set Covering Problem

KW - Teaching-Learning-Based Optimization algorithm

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

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

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

M3 - Conference contribution

AN - SCOPUS:84943334929

SN - 9783319214092

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

SP - 421

EP - 430

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, Aballay F, Misra S, Johnson F, Paredes F. A teaching-learning-based optimization algorithm for solving set covering problems. 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. 421-430. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-21410-833

A teaching-learning-based optimization algorithm for solving set covering problems

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this