Problema del conjunto de cobertura resuelto mediante el algoritmo Binario de Optimización basado en Enseñanza-Aprendizaje [The set covering problem solved by the Binary Teaching-Learning-based Optimization algorithm]

Crawford, B.Soto, R.Leiva, F.A.Johnson, F.Paredes, F.6/22/20222022-09-306/22/20222022-09-302015https://doi.org/10.1109/CISTI.2015.7170401The 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.application/pdfspainfo:eu-repo/semantics/closedAccessComputer ScienceSocial SciencesProblema del conjunto de cobertura resuelto mediante el algoritmo Binario de Optimización basado en Enseñanza-Aprendizaje [The set covering problem solved by the Binary Teaching-Learning-based Optimization algorithm]info:eu-repo/semantics/article10.1109/CISTI.2015.7170401http://purl.org/pe-repo/ocde/ford#1.02.01