Binarization methods for shuffled frog leaping algorithms that solve set covering problems

Broderick Crawford, Ricardo Soto, Cristian Peña, Marco Riquelme-Leiva, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

This work proposes Shuffled Frog Leaping Algorithms (SFLAs) to solve Set Covering Problems (SCPs). The proposed algorithms include eight transfer function and five discretization methods in order to solve the binary representation of SCP. Different instances of the SetCovering Problem are solved to test our algorithm showing very promising results.

Original languageEnglish
Title of host publicationSoftware Engineering in Intelligent Systems - Proceedings of the 4th Computer Science On-line Conference 2015, CSOC2015
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Zdenka Prokopova, Petr Silhavy
PublisherSpringer Verlag
Pages317-326
Number of pages10
ISBN (Print)9783319184722
DOIs
StatePublished - 2015
Externally publishedYes
Event4th International Conference on Computer Science On-line Conference, CSOC 2015 - Zlin, Czech Republic
Duration: 27 Apr 201530 Apr 2015

Publication series

NameAdvances in Intelligent Systems and Computing
Volume349
ISSN (Print)2194-5357

Conference

Conference4th International Conference on Computer Science On-line Conference, CSOC 2015
Country/TerritoryCzech Republic
CityZlin
Period27/04/1530/04/15

Keywords

  • Combinatiorial Optimization
  • Metaheuristics
  • Set Covering Problem
  • Shuffled Frog Leaping Algorithm

Fingerprint

Dive into the research topics of 'Binarization methods for shuffled frog leaping algorithms that solve set covering problems'. Together they form a unique fingerprint.

Cite this