×

zbMATH — the first resource for mathematics

Computing approximate solutions of the maximum covering problem with GRASP. (English) Zbl 0913.90202
Summary: We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a set of demand points. With each demand point, we associate a nonnegative weight. The task is to select a subset of \(p> 0\) sites from the set of potential facility sites, such that the sum of weights of the covered demand points is maximized. We describe a greedy randomized adaptive search procedure (GRASP) for the maximum covering problem that finds good, though not necessarily optimum, placement configurations. We describe a well-known upper bound on the maximum coverage which can be computed by solving a linear program and show that on large instances, the GRASP can produce facility placements that are nearly optimal.

MSC:
90B80 Discrete location and assignment
PDF BibTeX XML Cite
Full Text: DOI