A teaching-learning-based optimization algorithm for solving set covering problems

Broderick Crawford, Ricardo Soto, Felipe Aballay, Sanjay Misra, Franklin Johnson, Fernando Paredes

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

10 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 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.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings
EditorsMarina L. Gavrilova, Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Carmelo Torre, David Taniar, Bernady O. Apduhan, Ana Maria A.C. Rocha, Sanjay Misra
PublisherSpringer Verlag
Pages421-430
Number of pages10
ISBN (Print)9783319214092
DOIs
StatePublished - 2015
Externally publishedYes
Event15th International Conference on Computational Science and Its Applications, ICCSA 2015 - Banff, Canada
Duration: 22 Jun 201525 Jun 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9158
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Computational Science and Its Applications, ICCSA 2015
Country/TerritoryCanada
CityBanff
Period22/06/1525/06/15

Keywords

  • Combinatorial optimization
  • Metaheuristics
  • Set Covering Problem
  • Teaching-Learning-Based Optimization algorithm

Fingerprint

Dive into the research topics of 'A teaching-learning-based optimization algorithm for solving set covering problems'. Together they form a unique fingerprint.

Cite this