Heurísticas híbridas para o problema de cobertura de alvos utilizando sensores

Abstract

Sensor networks are becoming increasingly popular for surveillance, security, monitoring, among others ends. To solve the problem of positioning sensors within a given area and getting the maximum coverage of the targets, one can take into account the use of techniques that will not allow resources to be wasted. This paper presents eight heuristics that can be used to solve this problem. Two of them are present in the literature, two are adaptations of existing metaheuristics and the remaining four are modifications of the previous ones that, through computational experiments with different scenarios, have better performance than the others