• DocumentCode
    3339914
  • Title

    Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem

  • Author

    Crawford, Broderick ; Soto, Ricardo ; Pena, Cristian ; Riquelme-Leiva, Marco ; Torres-Rojas, Claudio ; Johnson, Franklin ; Paredes, Fernando

  • Author_Institution
    Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile
  • fYear
    2015
  • fDate
    17-20 June 2015
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results.
  • Keywords
    optimisation; set theory; SCP binary representation; SFLA; binarization functions; discretization method; metaheuristic shuffled frog leaping algorithm; optimization problems; set covering problem; Algorithm design and analysis; Computer science; Memetics; Optimized production technology; Standards; Water resources; Metaheuristics; Set Covering Problem; Shuffled Frog Leaping Algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Systems and Technologies (CISTI), 2015 10th Iberian Conference on
  • Conference_Location
    Aveiro
  • Type

    conf

  • DOI
    10.1109/CISTI.2015.7170376
  • Filename
    7170376
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3339914