Paper Info
Title
The Ordered Gradual Covering Location Problem on a Network
Abstract
In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance. The Ordered Median Location problem is a generalization of most of the classical locations problems like p-median or p-center problems. The OGCLP model provides a unifying structure for the standard location models and allows us to develop objectives sensitive to both relative and absolute customer-to-facility distances. We derive Finite Dominating Sets (FDS) for the one facility case of the OGCLP. Moreover, we present efficient algorithms for determining the FDS and also discuss the conditional case where a certain number of facilities is already assumed to exist and one new facility is to be added. For the multi-facility case we are able to identify a finite set of potential facility locations a priori, which essentially converts the network location model into its discrete counterpart. For the multi-facility discrete OGCLP we discuss several Integer Programming formulations and give computational results.
Year
DOI
Venue
2009
10.1016/j.dam.2009.08.003
Discrete Applied Mathematics
Keywords
DocType
Volume
ordered median location problem,ordered median function,ogclp model,network location,gradual cover model,facility case,network location model,multi-facility case,gradual covering,ordered gradual covering location,gradual cover location problem,multi-facility discrete ogclp,conditional case,dominating set,facility location
Journal
157
Issue
ISSN
Citations 
18
Discrete Applied Mathematics
5
PageRank 
References 
Authors
0.45
8
4
Name
Order
Citations
PageRank
O. Berman11604231.36
JöRg Kalcsics217023.42
Dmitry Krass348382.08
Stefan Nickel442741.70