The gradual covering decay location problem on a network

The gradual covering decay location problem on a network

0.00 Avg rating0 Votes
Article ID: iaor20042983
Country: Netherlands
Volume: 151
Issue: 3
Start Page Number: 474
End Page Number: 480
Publication Date: Dec 2003
Journal: European Journal of Operational Research
Authors: , ,
Keywords: networks, programming: integer
Abstract:

In covering problems it is assumed that there is a critical distance within which the demand point is fully covered, while beyond this distance it is not covered at all. In this paper we define two distances. Within the lower distance a demand point is fully covered and beyond the larger distance it is not covered at all. For a distance between these two values we assume a gradual coverage decreasing from full coverage at the lower distance to no coverage at the larger distance.

Reviews

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