Comparing Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms for Solving the Set Covering Problem

Simple item page
dc.authoridMisra, Sanjay/0000-0002-3556-9331
dc.authoridGalleguillos, Cristian/0000-0001-9460-8719
dc.authoridCrawford, Broderick/0000-0001-5500-0188
dc.authorscopusid24403038600
dc.authorscopusid23395875300
dc.authorscopusid55761197000
dc.authorscopusid56732706700
dc.authorscopusid56989906300
dc.authorscopusid56819679100
dc.authorscopusid56962766700
dc.authorwosidMisra, Sanjay/K-2203-2014
dc.authorwosidGalleguillos, Cristian/C-7756-2014
dc.contributor.authorSoto, Ricardo
dc.contributor.authorCrawford, Broderick
dc.contributor.authorGalleguillos, Cristian
dc.contributor.authorBarraza, Jorge
dc.contributor.authorLizama, Sebastian
dc.contributor.authorMunoz, Alexis
dc.contributor.authorParedes, Fernando
dc.date.accessioned2024-07-05T14:32:11Z
dc.date.available2024-07-05T14:32:11Z
dc.date.issued2015
dc.departmentAtılım Universityen_US
dc.department-temp[Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Barraza, Jorge; Lizama, Sebastian; Munoz, Alexis; Vilches, Jose] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile; [Soto, Ricardo] Univ Autonoma Chile, Santiago, Chile; [Soto, Ricardo] Univ Cient Sur, Lima, Peru; [Crawford, Broderick] Univ Cent Chile, Santiago, Chile; [Crawford, Broderick] Univ San Sebastian, Santiago, Chile; [Misra, Sanjay] Atilim Univ, Ankara, Turkey; [Paredes, Fernando] Univ Diego Portales, Escuela Ingn Ind, Santiago, Chileen_US
dc.descriptionMisra, Sanjay/0000-0002-3556-9331; Galleguillos, Cristian/0000-0001-9460-8719; Crawford, Broderick/0000-0001-5500-0188en_US
dc.description.abstractThe set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley's OR-Library.en_US
dc.identifier.citationcount6
dc.identifier.doi10.1007/978-3-319-21404-7_14
dc.identifier.endpage202en_US
dc.identifier.isbn9783319214047
dc.identifier.isbn9783319214030
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.scopus2-s2.0-84948971651
dc.identifier.startpage187en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-319-21404-7_14
dc.identifier.urihttps://hdl.handle.net/20.500.14411/752
dc.identifier.volume9155en_US
dc.identifier.wosWOS:000364988700014
dc.language.isoenen_US
dc.publisherSpringer-verlag Berlinen_US
dc.relation.ispartof15th International Conference on Computational Science and Its Applications (ICCSA) -- JUN 22-25, 2015 -- Banff, CANADAen_US
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.scopus.citedbyCount6
dc.subjectCombinatorial optimizationen_US
dc.subjectSet covering problemen_US
dc.subjectCuckoo search algorithmen_US
dc.subjectBee colony algorithmen_US
dc.subjectFirefly optimization algorithmen_US
dc.subjectElectromagnetism-Like algorithmen_US
dc.titleComparing Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms for Solving the Set Covering Problemen_US
dc.typeConference Objecten_US
dc.wos.citedbyCount6
dspace.entity.typePublication

Files

Collections

WOS
Scopus