Covering continuous demand in the plane

Covering continuous demand in the plane

0.00 Avg rating0 Votes
Article ID: iaor20103450
Volume: 61
Issue: 5
Start Page Number: 878
End Page Number: 881
Publication Date: May 2010
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

Continuous demand is generated in a convex polygon. A facility located in the area covers demand within a given radius. The objective is to find the locations for p facilities that cover the maximum demand in the area. A procedure that calculates the total area covered by a set of facilities is developed. A multi start heuristic approach for solving this problem is proposed by applying a gradient search from a randomly generated set of p locations for the facilities. Computational experiments for covering a square area illustrate the effectiveness of the proposed algorithm.

Reviews

Required fields are marked *. Your email address will not be published.