Locating a service facility and a rapid transit line

From MaRDI portal
Publication:4899271

DOI10.1007/978-3-642-34191-5_12zbMATH Open1374.90283arXiv1104.0753OpenAlexW2141063236MaRDI QIDQ4899271FDOQ4899271


Authors: P. Pérez-Lantero, J. M. Díaz-Báñez, Matias Korman, I. Ventura Edit this on Wikidata


Publication date: 7 January 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to the facility, using the L1 or Manhattan metric. The rapid transit line is represented by a line segment with fixed length and arbitrary orientation. The highway is an alternative transportation system that can be used by the clients to reduce their travel time to the facility. This problem was introduced by Espejo and Ch'ia in [7]. They gave both a characterization of the optimal solutions and an algorithm running in O(n3logn) time, where n represents the number of clients. In this paper we show that the Espejo and Ch'ia's algorithm does not always work correctly. At the same time, we provide a proper characterization of the solutions with a simpler proof and give an algorithm solving the problem in O(n3) time.


Full work available at URL: https://arxiv.org/abs/1104.0753




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Locating a service facility and a rapid transit line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899271)