Metaheuristic Approaches for the Minimum Vertex Guard Problem


We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. This problem is NP-hard with relevant practical applications. In this paper we propose three metaheuristic approaches to this problem. Combined with the genetic algorithms strategy, which was proposed in [4], these four approximation algorithms have been implemented and compared. The experimental evaluation from the hybrid strategy shows significant improvement in the number of guards compared to theoretical bounds.

8 Figures and Tables

Cite this paper

@article{Bajuelos2009MetaheuristicAF, title={Metaheuristic Approaches for the Minimum Vertex Guard Problem}, author={A. L. Bajuelos and A. M. Martins and S. Canales and G. Hernx0E1ndez}, journal={2009 Third International Conference on Advanced Engineering Computing and Applications in Sciences}, year={2009}, pages={77-82} }