Set covering problem resolution by Biogeography-Based Optimization Algorithm
MetadataShow full item record
The research on Artificial Intelligence and Operational Research has provided models and techniques to solve many industrial problems. For instance, many real life problems can be formulated as a Set Covering Problem (SCP). The SCP is a classic NP-hard combinatorial problem consisting in find a set of solutions that cover a range of needs at the lowest possible cost following certain constraints. In this work, we use a recent metaheuristic called Biogeography-Based Optimization Algorithm (BBOA) inspired by biogeography, which mimics the migration behavior of animals in nature to solve optimization and engineering problems. In this paper, BBOA for the SCP is proposed. In addition, to improve performance we provide a new feature for the BBOA, which improve stagnation in local optimum. Finally, the experiment results show that BBOA is a excellent method for solving such problems. © Springer International Publishing Switzerland 2016.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Riquelme L.; Olguín E. (Springer Verlag, 2016)
Biogeography-based optimization algorithm for the Set Covering Problem [Algoritmo de Optimización basado en Biogeografía para resolver el Set Covering Problem] (2020) Crawford B.; Soto R.; Riquelme L.; Olguin E. (IEEE Computer Society, 2016)
Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization (2020) Crawford B.; Soto R.; Olguín E.; Misra S.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)