A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems

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

research

oai:generic.eprints.org:10675/core482

A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems

Authors: Broderick Crawford
Ricardo Soto
Felipe Aballay
Sanjay Misra
Franklin Johnson
Fernando Paredes
Publication date: 19 June 2015
Publisher
Doi

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

Similar works

Full text

Open in the Core reader

Download PDF

Covenant University Repository

oai:generic.eprints.org:10675/...

Last time updated on 15/05/2018

This paper was published in Covenant University Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.