The 1-Center and 1-Highway problem revisited

J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, I. Ventura

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we extend the Rectilinear 1-center problem as follows: given a set S of n demand points in the plane, simultaneously locate a facility point f and a rapid transit line (i.e. highway) h that together minimize the expression max pSTh(p, f) , where Th(p, f) denotes the travel time between p and f. A point of S uses h to reach f if h saves time: every point p∈ S moves outside h at unit speed under the L1 metric, and moves along h at a given speed v> 1. We consider two types of highways: (1) a turnpike in which the demand points can enter/exit the highway only at the endpoints; and (2) a freeway problem in which the demand points can enter/exit the highway at any point. We solve the location problem for the turnpike case in O(n2) or O(nlog n) time, depending on whether or not the highway’s length is fixed. In the freeway case, independently of whether the highway’s length is fixed or not, the location problem can be solved in O(nlog n) time.

Original languageEnglish
Pages (from-to)167-179
Number of pages13
JournalAnnals of Operations Research
Volume246
Issue number1-2
DOIs
Publication statusPublished - 2016 Nov 1
Externally publishedYes

Keywords

  • Facility location
  • Geometric optimization
  • Rectilinear 1-center problem
  • Time metric

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'The 1-Center and 1-Highway problem revisited'. Together they form a unique fingerprint.

Cite this