A teaching-learning-based optimization algorithm for solving set covering problems
MetadataShow full item record
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. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
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] (2020) Crawford B.; Soto R.; Leiva F.A.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
Conference PaperCrawford B.; Soto R.; Guzmán N.; Johnson F.; Paredes F. (Springer Verlag, 2015)
Conference PaperSoto R.; Crawford B.; Lizama S.; Johnson F.; Paredes F. (Springer Verlag, 2016)