TY - RPRT
A1 - Berman, O.
A1 - Kalcsics, J.
A1 - Krass, D.
A1 - Nickel, S.
T1 - The ordered gradual covering location problem on a network
N2 - 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. Ordered Median Location problems are a generalization of most of the classical locations problems like p-median or p-center problems. They can be modeled by using so-called ordered median functions. These functions multiply a weight to the cost of fulfilling the demand of a customer which depends on the position of that cost relative to the costs of fulfilling the demand of the other customers. 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 are 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.
T3 - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 138
KW - Gradual Covering
KW - Ordered Median Function
KW - Network Location
Y1 - 2008
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1993
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-15606
ER -