2003
DOI: 10.1016/s0377-2217(02)00604-5
|View full text |Cite
|
Sign up to set email alerts
|

The gradual covering decay location problem on a network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
89
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 168 publications
(90 citation statements)
references
References 10 publications
0
89
0
Order By: Relevance
“…While this is a step in the right direction, it is ad-hoc and rather limited. More recently, Karasakal and Karasakal (2004) and Berman, Krass, and Drezner (2003) independently introduced coverage models where coverage decays gradually with distance. Karasakal and Karasakal (2004) focus on algorithmic issues, and they design a Lagrangian heuristic to solve the problem.…”
Section: Generalizations Of Coverage Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…While this is a step in the right direction, it is ad-hoc and rather limited. More recently, Karasakal and Karasakal (2004) and Berman, Krass, and Drezner (2003) independently introduced coverage models where coverage decays gradually with distance. Karasakal and Karasakal (2004) focus on algorithmic issues, and they design a Lagrangian heuristic to solve the problem.…”
Section: Generalizations Of Coverage Modelsmentioning
confidence: 99%
“…In their computational experiments, they assume that coverage changes from 1 (full coverage) to 0 (no coverage) in a narrower interval than would be appropriate for the context we focus on, where survival probability might decay gradually from around 30% to 5% when response time varies from 0 to 10 minutes. Berman, Krass, and Drezner (2003) present a structural result that allows one to limit candidate locations in a network to a finite set without loss of generality. Then, they show how the problem can be formulated as an uncapacitated facility location problem and they also provide an alternative and more efficient formulation.…”
Section: Generalizations Of Coverage Modelsmentioning
confidence: 99%
“…One active area of research has involved relaxing key assumptions in the basic location models outlined earlier. For example, Berman et al [2] consider a gradual covering model in which a demand is fully covered if the nearest facility is within l, uncovered if the nearest facility is further than u and partially covered if the nearest facility is between l and u distance units away. They show that, for convex decay functions, the maximal gradual covering problem can be restructured as a special case of the UFLP.…”
Section: Where To From Here?mentioning
confidence: 99%
“…Up to a distance r there is no decay due to distance (f (d) = 1), beyond a distance R > r no customer is attracted to the facility (f (d) = 0), and between r and R decline is linear. A general decay function in the context of gradual cover was analyzed in Berman and Krass [10] and Berman et al [14].…”
Section: The Distance Decay Functionmentioning
confidence: 99%
“…However, in some cases there were solutions with a relative error as high as 15%. (14)- (15)) where the only change is that f p ∆ p replaces f p in (14). Let the solution value of this problem be denoted by V 1 .…”
Section: The Greedy Heuristicmentioning
confidence: 99%