The set covering problem solved by the binary teaching-learning-based optimization algorithm

Author

Crawford, Broderick ; Soto, Ricardo ; Aballay Leiva, Felipe ; Johnson, Franklin ; Paredes, Fernando

Author_Institution

Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile

fYear

2015

fDate

17-20 June 2015

Firstpage

1

Lastpage

4

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 is used the binary version of Teaching-Learning-Based Optimization algorithm (TLBO), which works with two phases known as teacher and learner phases in this way emulates the behaviour into a classroom, besides this problem is solved with eight different transfer functions and five discretization methods all of them altogether to solve The Set Covering Problem from the OR-Library.

Keywords

optimisation; set theory; teaching; transfer functions; OR-library; SCP; TLBO; binary teaching-learning-based optimization algorithm; combinatorial optimization problem; set covering problem; transfer functions; Algorithm design and analysis; Europe; Media; Optimization; Silicon; Standards; Transfer functions; Binary Teaching-learning-based optimization algorithm (BTLBO); Metaheuristic; Optimization Problem; Set Covering Problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Systems and Technologies (CISTI), 2015 10th Iberian Conference on

Conference_Location

Aveiro

Type

conf

DOI

10.1109/CISTI.2015.7170401

Filename

7170401