Examinando por Autor "Vilches J."

Mostrando 1 - 1 de 1
  • Miniatura
    ÍtemAcceso Abierto
    Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem
    (Springer Verlag, 2015) Soto, R.; Crawford, B.; Galleguillos, C.; Barraza J.; Lizama S.; Muñoz A.; Vilches J.; Misra, S.; Paredes, F.
    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. © Springer International Publishing Switzerland 2015.