Title
A teaching-learning-based optimization algorithm for solving set covering problems
Date Issued
01 January 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
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 we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively.
Start page
421
End page
430
Volume
9158
Language
English
OCDE Knowledge area
Ciencias de la educación
Sistemas de automatización, Sistemas de control
Subjects
Scopus EID
2-s2.0-84943334929
ISBN
9783319214092
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
978-331921409-2
Conference
15th International Conference on Computational Science and Its Applications, ICCSA 2015
Sponsor(s)
Kyushu Sangyo University
Monash University
University of Basilicata
University of Calgary
University of Perugia
Sources of information:
Directorio de Producción Científica
Scopus