# zbMATH — the first resource for mathematics

Locating a service facility and a rapid transit line. (English) Zbl 1374.90283
Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 126-137 (2012).
Summary: 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 I. Espejo and A. M. Rodríguez-Chía [Comput. Oper. Res. 38, No. 2, 525–538 (2011; Zbl 1231.90274)]. 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 Rodríguez-Chía’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.
For the entire collection see [Zbl 1253.68016].

##### MSC:
 90B85 Continuous location
##### Keywords:
geometric optimization; facility location; time distance
Full Text:
##### References:
 [1] Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: Voronoi diagram for services neighboring a highway. Information Processing Letters 86, 283–288 (2003) · Zbl 1162.68725 · doi:10.1016/S0020-0190(02)00505-7 [2] Ahn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S., Wolff, A.: Constructing optimal highways. In: Proceedings of the 13th Computing: The Australasian Theory Symposium (CATS 2007), pp. 7–14 (2007) · Zbl 1171.90443 [3] Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city Voronoi diagram. Discrete & Computational Geometry 31, 17–35 (2004) · Zbl 1159.68614 · doi:10.1007/s00454-003-2947-0 [4] Aloupis, G., Cardinal, J., Collette, S., Hurtado, F., Langerman, S., O’Rourke, J., Palop, B.: Highway hull revisited. Computational Geometry: Theory and Applications 43, 115–130 (2010) · Zbl 1179.90028 · doi:10.1016/j.comgeo.2009.06.001 [5] Bae, S.W., Korman, M., Tokuyama, T.: All Farthest Neighbors in the Presence of Highways and Obstacles. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 71–82. Springer, Heidelberg (2009) · Zbl 1211.68461 · doi:10.1007/978-3-642-00202-1_7 [6] Cardinal, J., Collette, S., Hurtado, F., Langerman, S., Palop, B.: Optimal location of transportation devices. Computational Geometry: Theory and Applications 41, 219–229 (2008) · Zbl 1163.90359 · doi:10.1016/j.comgeo.2008.01.001 [7] Díaz-Báñez, J.-M., Korman, M., Pérez-Lantero, P., Ventura, I.: Locating a service facility and a rapid transit line. CoRR, abs/1104.0753 (2011) · Zbl 1374.90283 [8] Espejo, I., Rodríguez-Chía, A.M.: Simultaneous location of a service facility and a rapid transit line. Computers and Operations Research 38, 525–538 (2011) · Zbl 1231.90274 · doi:10.1016/j.cor.2010.07.013 [9] Korman, M., Tokuyama, T.: Optimal Insertion of a Segment Highway in a City Metric. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 611–620. Springer, Heidelberg (2008) · Zbl 1148.68550 · doi:10.1007/978-3-540-69733-6_60
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.