| dc.contributor.author | Crawford, B. | |
| dc.contributor.author | Soto, R. | |
| dc.contributor.author | Leiva, F.A. | |
| dc.contributor.author | Johnson, F. | |
| dc.contributor.author | Paredes, F. | |
| dc.date.accessioned | 2025-10-31T18:32:20Z | |
| dc.date.available | 2025-10-31T18:32:20Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12805/4597 | |
| dc.description.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. | en_US |
| dc.format | application/pdf | |
| dc.language.iso | spa | |
| dc.publisher | Institute of Electrical and Electronics Engineers | |
| dc.relation.ispartof | urn:isbn:978-9899-84-345-5 | |
| dc.rights | https://purl.org/coar/access_right/c_abf2 | |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/4.0/ | |
| dc.subject | Optimized Logistics and Vehicle Routing Solutions | en_US |
| dc.subject | Innovative Algorithms for Set Covering Optimization | en_US |
| dc.title | The set covering problem solved by the binary teaching-learning-based optimization algorithm | en_US |
| dc.type | https://purl.org/coar/resource_type/c_5794 | |
| dc.identifier.doi | https://doi.org/10.1109/CISTI.2015.7170401 | |
| dc.subject.ocde | https://purl.org/pe-repo/ocde/ford#1.02.01 | |
| dc.type.other | Conference Paper | |
| dc.identifier.journal | 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 | |
| dc.type.version | https://purl.org/coar/version/c_970fb48d4fbd8a85 | |