Guided Fireworks Algorithm Applied to the Maximal Covering Location Problem

摘要

Maximal covering location problem is an interesting and applicable hard optimization problem. It is a facility location problem where facilities have to be placed in optimal positions to maximize coverage of the weighted demand nodes, while respecting some constraints. This hard optimization problem has been successfully tackled by swarm intelligence algorithms. In this paper we propose adjustment of the recent guided fireworks algorithm for maximal covering location problem. We tested our approach on standard benchmark data sets and compared results with other approaches from literature where our proposed algorithm proved to be more successful, both in the quality of the coverage and convergence speed.