Mostrar el registro sencillo del ítem
| dc.contributor | Flores Castillo, Diego Esteban | ||
| dc.contributor | Crawford Labrín, Broderick | ||
| dc.creator | Embry Calderón, Gabriel Francisco Luis | ||
| Fecha Ingreso | dc.date.accessioned | 2021-10-21T02:32:17Z | |
| Fecha Disponible | dc.date.available | 2021-10-21T02:32:17Z | |
| Fecha en Repositorio | dc.date.issued | 2021-10-20 | |
| Resumen | dc.description | <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> | |
| Resumen | dc.description | last modification | |
| Resumen | dc.description | Ingeniero Civil en Informática | |
| Resumen | dc.description | INGENIERIA CIVIL INFORMATICA | |
| Resumen | dc.description | <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> | |
| Formato | dc.format | ||
| Lenguaje | dc.language | eng | |
| dc.rights | autorizado | ||
| dc.source | http://opac.pucv.cl/pucv_txt/txt-4000/UCC4150_01.pdf | ||
| Materia | dc.subject | METAHEURISTICA | |
| Materia | dc.subject | OPTIMIZACION MATEMATICA | |
| Materia | dc.subject | Procesamiento de datos | |
| Materia | dc.subject | ALGORITMOS COMPUTACIONALES | |
| Title | dc.title | An improved Monkey Algorithm for the set covering problem | |
| Tipo | dc.type | texto |
| Archivos | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay archivos asociados a este ítem. |
|||