Crawford, Broderick and Soto, Ricardo and Pena, Cristian and Riquelme-Leiva, Marco and Torres-Rojas, Claudio and Misra, Sanjay and Johnson, Franklin and Paredes, Fernando (2015) A Comparison of Three Recent Nature-Inspired Metaheuristics for the Set Covering Problem. In: International Conference on Computational Science and Its Applications.
![[img]](http://eprints.covenantuniversity.edu.ng/style/images/fileicons/application_pdf.png) |
PDF
Download (80kB) |
Abstract
The Set Covering Problem (SCP) is a classic problem in combinatorial optimization. SCP has many applications in engineering,including problems involving routing, scheduling, stock cutting, electoral redistricting and others important real life situations. Because of its importance, SCP has attracted attention of many researchers. However,SCP instances are known as complex and generally NP-hard problems.Due to the combinatorial nature of this problem, during the last decades,several metaheuristics have been applied to obtain efficient solutions.This paper presents a metaheuristics comparison for the SCP. Three recent nature-inspired metaheuristics are considered: Shuffled Frog Leaping,Firefly and Fruit Fly algorithms. The results show that they can obtainn optimal or close to optimal solutions at low computational cost.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Set Covering Problem · Metaheuristics · Shuffled Frog Leaping Algorithm · Firefly algorithm · Fruit fly algorithm |
| 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 14:09 |
| Last Modified: | 24 Apr 2018 14:09 |
| URI: | http://eprints.covenantuniversity.edu.ng/id/eprint/10677 |
Actions (login required)
 |
View Item |
