Crawford, Broderick and Soto, Ricardo and Aballay, Felipe and Misra, Sanjay and Johnson, Franklin and Paredes, Fernando (2015) A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems. In: International Conference on Computational Science and Its Applications.
![[img]](http://eprints.covenantuniversity.edu.ng/style/images/fileicons/application_pdf.png) |
PDF
Download (79kB) |
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Set Covering Problem · Teaching-Learning-Based Optimization algorithm · Combinatorial optimization · Metaheuristics |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
| Depositing User: | Mrs Hannah Akinwumi |
| Date Deposited: | 24 Apr 2018 13:27 |
| Last Modified: | 24 Apr 2018 13:27 |
| URI: | http://eprints.covenantuniversity.edu.ng/id/eprint/10675 |
Actions (login required)
 |
View Item |
