Document Type : Research Article
Department of Computer Science, University of Bojnord, Bojnord, Iran
Department of Computer Engineering, University of Bojnord, Bojnord, Iran
This paper presents a new heuristic algorithm for the following covering problem. For a set of $n$ demand points in continuous space, locate a given number of facilities or sensors anywhere on the plane in order to obtain maximum coverage. This means, in this problem an infinite set of potential locations in continuous space should be explored. We present a heuristic algorithm that finds a near-optimal solution for large-scale instances of this problem in a reasonable time. Moreover, we compare our results with previous algorithms on randomly generated datasets that vary in size and distribution. Our experiments show that in comparison to other methods in the literature, the proposed algorithm is scalable and can find solutions for large-scale instances very fast, when previous algorithms unable to handle these instances. Finally, some results of the tests performed on a real-world dataset are also presented.