Um algoritmo enxame de partículas para uma variante do problema de máxima cobertura

Abstract

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 optimality were randomly generated. A BPSO heuristic for the abovementioned variant was developed, which was compared with the exact method and with an adaptation of the classical Chvá- tal heuristic. The obtained results indicate that the proposed approach has considerable potential for achieving good solutions.