Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Entities
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Lizama, Sebastian"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Conference Object
    Citation - WoS: 6
    Citation - Scopus: 6
    Comparing Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms for Solving the Set Covering Problem
    (Springer-verlag Berlin, 2015) Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Barraza, Jorge; Lizama, Sebastian; Munoz, Alexis; Paredes, Fernando
    The 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.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
Entities
  • Research Outputs
  • Organizations
  • Researchers
  • Projects
  • Awards
  • Equipments
  • Events
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH
OpenAIRE Logo
OpenDOAR Logo
Jisc Open Policy Finder Logo
Harman Logo
Base Logo
OAI Logo
Handle System Logo
ROAR Logo
ROARMAP Logo
Google Scholar Logo

Log in to GCRIS Dashboard

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback