Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorLeiva F.A.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:40Z
dc.date.available2020-09-02T22:15:40Z
dc.date.issued2015
dc.identifier10.1109/CISTI.2015.7170401
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4151
dc.descriptionThe 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.
dc.language.isoes
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectBinary Teaching-learning-based optimization algorithm (BTLBO)
dc.subjectMetaheuristic
dc.subjectOptimization Problem
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectDiscrete event simulation
dc.subjectInformation systems
dc.subjectLearning algorithms
dc.subjectTeaching
dc.subjectCombinatorial optimization problems
dc.subjectDiscretization method
dc.subjectMetaheuristic
dc.subjectOptimization problems
dc.subjectReal-world
dc.subjectSet covering problem
dc.subjectTeaching-learning-based optimizations
dc.subjectOptimization
dc.titleThe 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]
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record