The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje]
Autor
Crawford B.
Soto R.
Leiva F.A.
Johnson F.
Paredes F.
Resumen
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. © 2015 AISTI.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020)
Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto] (2020)
Crawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos] (2020)
Crawford B.; Soto R.; Olea C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)