A teaching-learning-based optimization algorithm for solving set covering problems
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 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.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Conference Paper
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)
(Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
Recent harmony search algorithms for 0–1 optimization problems (2020)
(Springer Verlag, 2015) -
Conference Paper
A XOR-based ABC algorithm for solving set covering problems (2020)
(Springer Verlag, 2016)