The coherent covering location problem
Daniel Serra
- Vol. 75, Iss: 1, pp 79-101
Reads0
Chats0
TLDR
In this paper the concept of coherence is introduced within a network location covering framework: the Coherent Covering Location Problem locates two hierarchical facility levels by maximizing the coverage while ensuring coherence.Abstract:
In a location-allocation system, it is necessary to obtain not only an efficient set of facility locations, but also an efficient relationship among the catchment areas This is especially important in services that are hierarchical in nature and where there is a strong relationship between the different levels In seeking an effective relation among the different levels, all the areas assigned to a particular facility at one hierarchical level should belong to one and the same district in the next level This property leads to a “coherent” districting structure In this paper the concept of coherence is introduced within a network location covering framework: the Coherent Covering Location Problem locates two hierarchical facility levels by maximizing the coverage while ensuring coherence Adaptations of the model to different location patterns and computational experience are providedread more
Citations
More filters
Journal ArticleDOI
Survey: Covering problems in facility location: A review
TL;DR: This survey tries to review all aspects of the covering problems by stressing the works after Schilling, Jayaraman, and Barkhi (1993).
Journal ArticleDOI
A review of hierarchical facility location models
Güvenç Şahin,Haldun Süral +1 more
TL;DR: This study reviews the selected material in the literature, including more than 70 studies dated 1986 or later, and investigates the applications, mixed integer programming models, and solution methods presented for the hierarchical facility location models.
Journal ArticleDOI
Does Detrending Matter For the Determination of the Reference Cycle and the Selection of Turning Points
TL;DR: This paper examined the sensitivity of turning points classification to detrending and compared the implied cycles to those derived by NBER or DOC researchers, and found that turning point dates are broadly insensitive to detending with one dating rule but not the other and many procedures generate false alarms and miss several common turning points with the latter one.
Journal ArticleDOI
Survey: Hierarchical facility location problem: Models, classifications, techniques, and applications
TL;DR: This paper presents a comprehensive review of over 40years of hierarchical facility location modeling efforts and identifies the gaps in the current literature and suggests directions for future modeling efforts.
Journal ArticleDOI
Locational analysis for regionalization of Turkish Red Crescent blood services
TL;DR: This study develops several mathematical models to solve the location–allocation decision problems in regionalization of blood services of the Turkish Red Crescent Society.
References
More filters
Journal ArticleDOI
The maximal covering location problem
TL;DR: The use of a maximal service distance as a measure of the value of a given locational configuration has been discussed at length by Toregas and ReVelle 1 who show that it is an important surrogate measurement for the value.
Journal ArticleDOI
The Hierarchical Service Location Problem
George C. Moore,Charles ReVelle +1 more
TL;DR: An application is described that uses distance and population data developed for a region of Honduras to develop a nationwide data set of populated places to which location methodologies will be applied.
Journal ArticleDOI
Hierarchical location-allocation problems: A classification scheme
TL;DR: In this article, the authors classify the hierarchical location allocation problems into two classes: the p-median problem and the total weighted travel distance minimization problem, where the goal is to locate p facilities among n (⩾ p ) locations such that the total travel distance is minimized.