A stochastic gradual cover location problem

A stochastic gradual cover location problem

0.00 Avg rating0 Votes
Article ID: iaor20103530
Volume: 57
Issue: 4
Start Page Number: 367
End Page Number: 372
Publication Date: Jun 2010
Journal: Naval Research Logistics
Authors: , ,
Abstract:

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented.

Reviews

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