The set covering problem solved by the binary teaching-learning-based optimization algorithm

Thumbnail
Date
2015
Author(s)
Crawford, B.
Soto, R.
Leiva, F.A.
Johnson, F.
Paredes, F.
Metadata
Show full item record
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.
URI
https://hdl.handle.net/20.500.12805/4597
DOI
https://doi.org/10.1109/CISTI.2015.7170401
Collections
Subject
https://purl.org/coar/access_right/c_abf2
Except where otherwise noted, this item's license is described as https://purl.org/coar/access_right/c_abf2