Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje

Translated title of the contribution: The set covering problem solved by the binary teaching-learning-based optimization algorithm

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Felipe Aballay Leiva, Franklin Johnson, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Translated title of the contributionThe set covering problem solved by the binary teaching-learning-based optimization algorithm
Original languageSpanish
Title of host publication2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9789899843455
DOIs
StatePublished - 28 Jul 2015
Event10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal
Duration: 17 Jun 201520 Jun 2015

Publication series

Name2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

Conference

Conference10th Iberian Conference on Information Systems and Technologies, CISTI 2015
CountryPortugal
CityAveiro
Period17/06/1520/06/15

Fingerprint Dive into the research topics of 'The set covering problem solved by the binary teaching-learning-based optimization algorithm'. Together they form a unique fingerprint.

Cite this