Abstract
In this paper, we consider the problem of how the transportation network can be modified most efficiently in order to improve the known location of the facilities. The performance of the facilities is measured by the “minisum” objective. We examine in the paper two types of network modifications: reductions and additions of links. We analyze various reduction and addition problems for both trees and general networks. For trees, we present exact results and algorithms for the majority of problems studied. For general networks, we discuss mainly heuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1(1959)269.
S.L. Hakimi, Optimum locations of switching centers and the absolute centers and medians of a graph, Oper. Res. 12(1964)450–459.
G.Y. Handler and P.B. Mirchandani,Location on Networks: Theory and Algorithms (The MIT Press, Cambridge, MA, 1979).
D.I. Ingco, Network design problems for improving facility locations, Ms.C. Thesis, MIT (1989), unpublished.
T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transp. Sci. 18(1984)1–55.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Berman, O., Ingco, D.I. & Odoni, A.R. Improving the location of minisum facilities through network modification. Ann Oper Res 40, 1–16 (1992). https://doi.org/10.1007/BF02060467
Issue Date:
DOI: https://doi.org/10.1007/BF02060467