Um algoritmo enxame de partículas para uma variante do problema de máxima cobertura
This paper aims at reporting on the development of a Binary Particle Swarm Optimization Algorithm (BPSO) for a variant of the Maximum Covering Problem. This variant consists of a minimization problem, which is similar to the p-medians problem. A set of 10 medium size instances that were solved for o...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | por |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | http://www.repositorio.ufc.br/handle/riufc/12499 |
| País: | Brasil |
| Oai: | oai:www.repositorio.ufc.br:riufc/12499 |