2004
DOI: 10.1016/s0305-0548(03)00105-9
|View full text |Cite
|
Sign up to set email alerts
|

A maximal covering location model in the presence of partial coverage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
64
0
1

Year Published

2007
2007
2019
2019

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 163 publications
(68 citation statements)
references
References 17 publications
0
64
0
1
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 2 more Smart Citations
“…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%
“…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. 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.…”
Section: Generalizations Of Coverage Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…After the changes, the objective function still keeps linear, and former problem will be solved more easily after the difficulty constraints are absorbed. The literatures [14][15][16] introduce the application of the LaGrange and heuristic algorithm in site selection and optimization of combination.…”
Section: Analyses For Lagrange An Heuristic Algorithmmentioning
confidence: 99%
“…An acceptable upper limit for the service distance should best represents a point of indifference between costs of travel and individual demand for a product. This is especially important when considering a basic assumption of "binary coverage" in almost all covering models up to date: demand points are covered completely if located within the critical distance of the facility and not covered at all outside of the critical distance (although there have been approaches to account for "partial coverage" in relation to distance from a facility such as Karasakal and Karasakal (2004)). In this application, the service distance of a food retail outlet should resemble a barrier after which it is no longer practicable to bear the periodic travel to and from the outlet based on a means of transportation.…”
Section: Covering Problemsmentioning
confidence: 99%