<p>The Set Covering Problem -SCP- is a well-known NP-hard problem of combinatorial analytic. This problem consists in to find solutions covering the needs at lower cost. Those needs can be services to cities, load balancing in production lines or data-banks selections. In this work, we study the resolution of the SCP through the Improved Binary Monkey Algorithm -IBMA-, and a new variation of its. This algorithm is based in swarm intelligence inspired from the mountain-climbing behavior of monkeys. We also will be realize comparatives test between the IBMA, the IBMAV and the Binary Cat Swarm Optimization -BCSO-</p>
last modification
Ingeniero Civil en Informática
INGENIERIA CIVIL INFORMATICA
<p>The Set Covering Problem -SCP- is a well-known NP-hard problem of combinatorial analytic. This problem consists in to find solutions covering the needs at lower cost. Those needs can be services to cities, load balancing in production lines or data-banks selections. In this work, we study the resolution of the SCP through the Improved Binary Monkey Algorithm -IBMA-, and a new variation of its. This algorithm is based in swarm intelligence inspired from the mountain-climbing behavior of monkeys. We also will be realize comparatives test between the IBMA, the IBMAV and the Binary Cat Swarm Optimization -BCSO-</p>