Examinando por Autor "Figueroa, I."

Mostrando 1 - 2 de 2
  • Miniatura
    ÍtemAcceso Abierto
    A black hole algorithm for solving the set covering problem
    (Springer Verlag, 2016) Soto, R.; Crawford, B.; Figueroa, I.; Niklander, S.; Olguín, E.
    The set covering problem is a classical optimization benchmark with many industrial applications such as production planning, assembly line balancing, and crew scheduling among several others. In this work, we solve such a problem by employing a recent nature-inspired metaheuristic based on the black hole phenomena. The core of such a metaheuristic is enhanced with the incorporation of transfer functions and discretization methods to handle the binary nature of the problem. We illustrate encouraging experimental results, where the proposed approach is capable to reach various global optimums for a well-known instance set from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2016.
  • Miniatura
    ÍtemAcceso Abierto
    El problema de cobertura de conjuntos solucionado por el algoritmo del Agujero Negro [The set covering problem solved by the Black Hole algorithm]
    (IEEE Computer Society, 2016) Soto, R.; Crawford, B.; Figueroa, I.; Olivares, R.; Olguin, E.
    The Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem. The black hole algorithm is a metaheuristic that is inspired by nature, especially by the black hole phenomenon in space. To improve the performance of metaheuristics are used repairing operator, which those solutions that violate the constraints, preprocessing accelerate the resolution of the problem, and transfer function and discretization function to adapts the solutions to a binary domains. We report interesting and competitive experimental results on a set of 45 instances preprocessed the Set Covering Problem. © 2016 AISTI.