Abstract
This paper determines the optimal location of K connections in the plane, where a connection links pairs of existing facilities. Both uncapacitated and capacitated versions of the problem are considered. Discretization results for general polyhedral gauges and other properties are established. Two heuristic algorithms are developed for each case using the concept of a shortest path flow set coupled with a sequential location and allocation approach. Computational results show that the algorithms are efficient and accurate.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aykin, T. (1988). “On the location of hub facilities.” Transportation Science 22, 155–157.
Aykin, T. and G.F. Brown. (1992). “Interacting New Facilities and Location-Allocation Problem.” Transportation Science 26, 212–222.
Brandeau, M.L. and S.S. Chiu. (1993). “Sequential Location and Allocation: Worst Case Performance and Statistical Estimation.” Location Science 1, 289–298.
Cooper, L. (1963). “Location-Allocation Problems.” Operations Research 11, 331–343.
Cooper, L. (1964). “Heuristic Methods for Location-Allocation Problems.” SIAM Review 6, 37–53.
Cooper, L. (1972). “The Transportation-Location Problem.” Operations Research 20, 94–108.
Daskin, M.S. (1995). Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York.
Durier, R. and C. Michelot. (1985). “Geometrical Properties of the Fermat-Weber Problem.” European Journal of Operational Research 20, 332–343.
Eilon, S., C.D.T. Watson-Gandy, and N. Christofides. (1971). Distribution Management: Mathematical Modelling and Practical Analysis. Hafner, New York.
Francis, R.L., T.J. Lowe, and M.B. Rayco. (1996). “Row-Column Aggregation for Rectilinear Distance p-Median Problems.” Transportation Science 30, 160–174.
Hodgon, M.J., K.E. Rosing, and F. Shmulevitz. (1993). A Review of Location-Allocation Applications Literature. Studies in Locational Analysis 5, 2–29.
Huang, S., R. Batta, and R. Nagi. (2003). Variable capacity sizing and selection of connections in a facility layout. IIE Transactions 35, 49–59.
Huang, S., R. Batta, and R. Nagi. (2004). Selection and sizing of congested connections for a transportation network. Naval Research Logistics, submitted.
Mirchandani, P.B. and R.L. Francis. (1990). Discrete Location Theory. John Wiley, New York.
Montreuil, B. and H.D. Ratliff. (1988). Optimizing the Location of Input/Output Stations within Facilities layout. Engineering Costs and Production Economics 14, 177–187.
Nickel, S. (1995). Discretization of Planar Location Problems. Shaker Verlag, Aachen.
O'Kelly, M. (1986). “The Location of Interacting Hub Facilities.” Transportation Science 20, 92–106.
O'Kelly, M. (1992). “A Clustering Approach to the Planar Hub Location Problem.” Annals of Operations Research 40, 339–353.
Plastria, F. (1995). “Continuous location problems.” In Z. Drezner, (ed.), Facility Location: A Survey of Applications and Methods. Springer, NY, pp. 225–260.
Robenhymer, B. and S. Estrada. (1998). “Designing Transit at the World's Busiest International Border Crossing.” Presented at the 68th Annual Meeting of the Institute of Transportation Engineers, Toronto.
Ward, J.E. and R.E. Wendell. (1985). “Using Block Norms for Location Modelling.” Operations Research 33, 1074–1090.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huang, S., Batta, R., Klamroth, K. et al. The K-Connection Location Problem in a Plane. Ann Oper Res 136, 193–209 (2005). https://doi.org/10.1007/s10479-005-2045-1
Issue Date:
DOI: https://doi.org/10.1007/s10479-005-2045-1