Improving the location of minisum facilities through network modification. (English) Zbl 0787.90035
Summary: 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.
MSC:
| 90B80 | Discrete location and assignment |
| 90C35 | Programming involving graphs or networks |
| 90B06 | Transportation, logistics and supply chain management |
References:
| [1] | E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1(1959)269. · Zbl 0092.16002 · doi:10.1007/BF01386390 |
| [2] | S.L. Hakimi, Optimum locations of switching centers and the absolute centers and medians of a graph, Oper. Res. 12(1964)450–459. · Zbl 0123.00305 · doi:10.1287/opre.12.3.450 |
| [3] | G.Y. Handler and P.B. Mirchandani,Location on Networks: Theory and Algorithms (The MIT Press, Cambridge, MA, 1979). · Zbl 0533.90026 |
| [4] | D.I. Ingco, Network design problems for improving facility locations, Ms.C. Thesis, MIT (1989), unpublished. |
| [5] | T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transp. Sci. 18(1984)1–55. · doi:10.1287/trsc.18.1.1 |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
