Crawford, Broderick and Soto, Ricardo and Torres-Rojas, Claudio and Pena, Cristian and Riquelme-Leiva, Marco and Misra, Sanjay and Johnson, Franklin and Paredes, Fernando (2015) A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem. ICCSA. pp. 411-420.
![[img]](http://eprints.covenantuniversity.edu.ng/style/images/fileicons/application_pdf.png) |
PDF
Download (76kB) |
Abstract
The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Set Covering Problem · Fruit Fly Optimization Algorithm · Metaheuristics · Combinatorial optimization problem |
| 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:15 |
| Last Modified: | 24 Apr 2018 14:15 |
| URI: | http://eprints.covenantuniversity.edu.ng/id/eprint/10680 |
Actions (login required)
 |
View Item |
