Locating a service facility and a rapid transit line

Details Locating a service facility and a rapid transit line Locating a service facility and a rapid transit line

2011-04-05

arxiv.org/abs/1104.0753v3

Computer Science

Computational Geometry

Abstract submitted to the XIV Spanish Meeting on Computational Geometry

Scientific paper

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 $L_1$ 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(n^3\log n)$ 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(n^3)$ time.

Affiliated with

Also associated with

No associations

Rating

Locating a service facility and a rapid transit line does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Locating a service facility and a rapid transit line, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locating a service facility and a rapid transit line will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320905