Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje

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

doi:10.1109/CISTI.2015.7170401

Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje

Translated title of the contribution: The set covering problem solved by the binary teaching-learning-based optimization algorithm

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

SCHOOL OF COMPUTER ENGINEERING

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

2 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 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.

Translated title of the contribution	The set covering problem solved by the binary teaching-learning-based optimization algorithm
Original language	Spanish
Title of host publication	2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9789899843455
DOIs	https://doi.org/10.1109/CISTI.2015.7170401
State	Published - 28 Jul 2015
Event	10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal Duration: 17 Jun 2015 → 20 Jun 2015

Publication series

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

Conference

Conference	10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Country/Territory	Portugal
City	Aveiro
Period	17/06/15 → 20/06/15

Access to Document

10.1109/CISTI.2015.7170401

Cite this

Crawford, B., Soto, R., Leiva, F. A., Johnson, F., & Paredes, F. (2015). Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 Article 7170401 (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISTI.2015.7170401

Crawford, Broderick ; Soto, Ricardo ; Leiva, Felipe Aballay et al. / Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje. 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015).

@inproceedings{d236d041af434bd4b09665d9f4b25df3,

title = "Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimizaci{\'o}n Basado en Ense{\~n}anza- Aprendizaje",

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 = "Binary Teaching-learning-based optimization algorithm (BTLBO), Metaheuristic, Optimization Problem, Set Covering Problem",

author = "Broderick Crawford and Ricardo Soto and Leiva, {Felipe Aballay} and Franklin Johnson and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} 2015 AISTI.; 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 ; Conference date: 17-06-2015 Through 20-06-2015",

year = "2015",

month = jul,

day = "28",

doi = "10.1109/CISTI.2015.7170401",

language = "Spanish",

series = "2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015",

}

Crawford, B , Soto, R, Leiva, FA, Johnson, F & Paredes, F 2015, Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje. in 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015., 7170401, 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, Institute of Electrical and Electronics Engineers Inc., 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, Aveiro, Portugal, 17/06/15. https://doi.org/10.1109/CISTI.2015.7170401

Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje. / Crawford, Broderick ; Soto, Ricardo; Leiva, Felipe Aballay et al.
2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7170401 (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015).

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

TY - GEN

T1 - Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Leiva, Felipe Aballay

AU - Johnson, Franklin

AU - Paredes, Fernando

PY - 2015/7/28

Y1 - 2015/7/28

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 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.

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 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.

KW - Binary Teaching-learning-based optimization algorithm (BTLBO)

KW - Metaheuristic

KW - Optimization Problem

KW - Set Covering Problem

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

U2 - 10.1109/CISTI.2015.7170401

DO - 10.1109/CISTI.2015.7170401

M3 - Conference contribution

AN - SCOPUS:84943327645

T3 - 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

BT - 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

Y2 - 17 June 2015 through 20 June 2015

ER -

Crawford B , Soto R, Leiva FA, Johnson F, Paredes F. Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7170401. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). doi: 10.1109/CISTI.2015.7170401

Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this