The Ordered Gradual Covering Location Problem on a Network

  • Authors:

  • Oded Berman;Jörg Kalcsics;Dmitry Krass;Stefan Nickel

  • Affiliations:

  • Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, ONT M5S 3E6, Canada;Institute of Operations Research, Karlsruhe Institute of Technology, Kaiserstr. 12, 76131 Karlsruhe, Germany;Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, ONT M5S 3E6, Canada;Institute of Operations Research, Karlsruhe Institute of Technology, Kaiserstr. 12, 76131 Karlsruhe, Germany and Fraunhofer ITWM, Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

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.