Title
The set covering problem solved by the binary teaching-learning-based optimization algorithm
Other title
[Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje]
Date Issued
28 July 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Publisher(s)
Institute of Electrical and Electronics Engineers Inc.
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.
Language
Spanish
OCDE Knowledge area
Matemáticas
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-84943327645
ISBN
9789899843455
Resource of which it is part
2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
ISBN of the container
978-989984345-5
Conference
10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Sources of information:
Directorio de Producción Científica
Scopus