The gradual covering problem

The gradual covering problem

0.00 Avg rating0 Votes
Article ID: iaor20052462
Country: United States
Volume: 51
Issue: 6
Start Page Number: 841
End Page Number: 855
Publication Date: Sep 2004
Journal: Naval Research Logistics
Authors: , ,
Keywords: Weber problem
Abstract:

In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented.

Reviews

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