Examinando por Autor "Riquelme-Leiva, M."

Mostrando 1 - 2 de 2
  • Miniatura
    ÍtemAcceso Abierto
    A binary fruit fly optimization algorithm to solve the set covering problem
    (Springer Verlag, 2015) Crawford, B.; Soto, R.; Torres-Rojas, C.; Peña, C.; Riquelme-Leiva, M.; Misra, S.; Johnson, F.; Paredes, F.
    The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library. © Springer International Publishing Switzerland 2015.
  • Miniatura
    ÍtemAcceso Abierto
    A comparison of three recent nature-inspired metaheuristics for the set covering problem
    (Springer Verlag, 2015) Crawford, B.; Soto, R.; Peña, C.; Riquelme-Leiva, M.; Torres-Rojas, C.; Misra, S.; Johnson, F.; Paredes, F.
    The Set Covering Problem (SCP) is a classic problem in combinatorial optimization. SCP has many applications in engineering, including problems involving routing, scheduling, stock cutting, electoral redistricting and others important real life situations. Because of its importance, SCP has attracted attention of many researchers. However, SCP instances are known as complex and generally NP-hard problems. Due to the combinatorial nature of this problem, during the last decades, several metaheuristics have been applied to obtain efficient solutions. This paper presents a metaheuristics comparison for the SCP. Three recent nature-inspired metaheuristics are considered: Shuffled Frog Leaping, Firefly and Fruit Fly algorithms. The results show that they can obtainn optimal or close to optimal solutions at low computational cost. © Springer International Publishing Switzerland 2015.