Examinando por Autor "Salas, J."
Mostrando 1 - 8 de 8
Resultados por página
Opciones de ordenación
Ítem Acceso Abierto Un algoritmo Binario inspirado en hoyos negros para resolver el Problema de la Cobertura [An Binary black hole algorithm to solve the Set Covering problem](IEEE Computer Society, 2016) Gomez A.; Crawford, B.; Soto, R.; Jaramillo, A.; Mansilla, S.; Salas, J.; Olguin, E.The Set Covering Problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions. © 2016 AISTI.Ítem Acceso Abierto An approach to solve the Set Covering Problem with the Soccer League Competition algorithm(Springer Verlag, 2016) Jaramillo, A.; Crawford, B.; Soto, R.; Misra, S.; Olguín, E.; Rubio Á.G.; Salas, J.; Villablanca S.M.The Soccer League Competition algorithm (SLC) is a new nature-based metaheuristic approach to solve optimization problems. It gets its basis model from the interaction between soccer teams and their players in a soccer league competition, where each player (feasible solution) compete for victory and be the best player. This paper presents a review of the underlaying SLC model and a practical approach to solve the Set Covering Problem using SLC and Python as programming language and tested over a widely OR-Library SCP benchmarks to obtain convergence capability and effectiveness of the implementation. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto An artificial fish swarm optimization algorithm to solve set covering problem(Springer Verlag, 2016) Crawford, B.; Soto, R.; Olguín, E.; Villablanca S.M.; Rubio Á.G.; Jaramillo, A.; Salas, J.The Set Covering Problem (SCP) consists in finding a set of solutions that allow to cover a set of necessities with the minor possible cost. There are many applications of this problem such as rolling production lines or installation of certain services like hospitals. SCP has been solved before with different algorithms like genetic algorithm, cultural algorithm or firefly algorithm among others. The objective of this paper is to show the performance of an Artificial Fish Swarm Algorithm (AFSA) in order to solve SCP. This algorithm, simulates the behavior of a fish shoal inside water and it uses a population of points in space to represent the position of a fish in the shoal. Here we show a study of its simplified version of AFSA in a binary domain with its modifications applied to SCP. This method was tested on SCP benchmark instances from OR-Library website. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto An binary black hole algorithm to solve set covering problem(Springer Verlag, 2016) Rubio Á.G.; Crawford, B.; Soto, R.; Jaramillo, A.; Villablanca S.M.; Salas, J.; Olguín, E.The set covering problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions. After tray this algorithm, we implemented some improvements in certain operators, as well as added others also inspired by black holes physical behavior, to optimize the search and exploration to improving the results. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Binary harmony search algorithm for solving set-covering problem(Springer Verlag, 2016) Salas, J.; Crawford, B.; Soto, R.; Rubio Á.G.; Jaramillo, A.; Mansilla Villablanca, S.; Olguín, E.This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization(Springer Verlag, 2016) Crawford, B.; Soto, R.; Olguín, E.; Misra, S.; Villablanca, S.M.; Rubio, Á.G.; Jaramillo, A.; Salas, J.The Set Covering Problem (SCP) is a matrix that is composed of zeros and ones and consists in finding a subset of zeros and ones also, in order to obtain the maximum coverage of necessities with a minimal possible cost. In this world, it is possible to find many practical applications of this problem such as installation of emergency services, communications, bus stops, railways, airline crew scheduling, logical analysis of data or rolling production lines. SCP has been solved before with different nature inspired algorithms like fruit fly optimization algorithm. Therefore, as many other nature inspired metaheuristics which imitate the behavior of population of animals or insects, Artificial Fish Swarm Algorithm (AFSA) is not the exception. Although, it has been tested on knapsack problem before, the objective of this paper is to show the performance and test the binary version of AFSA applied to SCP, with its main steps in order to obtain good solutions. As AFSA imitates a behavior of a population, the main purpose of this algorithm is to make a simulation of the behavior of fish shoal inside water and it uses the population as points in space to represent the position of fish in the shoal. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Solving the set covering problem with the soccer league competition algorithm(Springer Verlag, 2016) Jaramillo, A.; Crawford, B.; Soto, R.; Villablanca, S.M.; Rubio, Á.G.; Salas, J.; Olguín, E.The Soccer League Competition (SLC) algorithm is a new metaheuristic approach intendended to solve complex optimization problems. It is based in the interaction model present in soccer teams and the goal to win every match, becoming the best team and league of players. This paper presents adaptations to the initial mode of SLC for the purpose of being applied to the Set Covering Problem (SCP) with a Python implementation. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Utilizando el algoritmo del Campeonato de Futbol para resolver el Problema del Conjunto de Cobertura [Using the Soccer League Competition algorithm to solve the set covering problem](IEEE Computer Society, 2016) Jaramillo, A.; Gomez, A.; Mansilla, S.; Salas, J.; Crawford, B.; Soto, R.; Olguin, E.The Soccer League Competition algorithm is a recently new approach to solve optimization problems using metaheuristic technique. It is based in the interaction between soccer players and teams, and the primary objective to win each match and become the best team player or league player. The present paper intends the Python programmatic implementation of Soccer League Competition to solve the Set Covering Problem. © 2016 AISTI.