Abstract
An efficient method for solving Linear Bottleneck Transportation problems is described. The method starts with a heuristically determined lower bound for the optimal value. Shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed. A FORTRAN IV subroutine can be found in the appendix.
Zusammenfassung
Ein effizientes Verfahren zur Lösung linearer Engpaßtransportprobleme wird beschrieben. Dabei wird von einer heuristisch bestimmten unteren Schranke für den Optimalwert ausgegangen. Anschließend werden kürzeste erweiternde Wege mit Hilfe einer Modifikation des Algorithmus von Dijkstra bestimmt. Ausführliche numerische Untersuchungen sind dargestellt und diskutiert. Eine FORTRAN IV Subroutine findet sich im Anhang.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burkard, R. E.: A general hungarian method for the algebraic transportation problem. Discrete Math.22, 219–232 (1978).
Burkard, R. E., Zimmermann, U.: Weakly admissible transformations for solving algebraic assignment and transportation problems, Report 77-3, Mathematisches Institut der Universität zu Köln, 1977. (Submitted for publication.)
Burkard, R. E., Zimmermann, U.: The solution of algebraic assignment and transportation problems, in: Optimization and Operations Research (Henn, R., Korte, B., Oettli, W., eds.). Springer LN in Econ. and Math. Systems157, 55–65 (1978).
Derigs, U., Zimmermann, U.: An augmenting path method for solving linear bottleneck assignment problems. Computing19, 285–295 (1978).
Dijkstra, E. W.: A note on two problems in connection with graphs. Numerische Mathematik1, 269–271 (1959).
Edmonds, J., Fulkerson, R.: Bottleneck extrema. J. Comb. Theory8, 299–306 (1970).
Esser, R., Meis, T.: Sortieren und Suchen. Vorlesungsskriptum, Mathematisches Institut, Universität zu Köln, Köln 1977.
Garfinkel, R. S., Rao, M. R.: The bottleneck transportation problem. Nav. Res. Log. Quart.18, 465–472 (1971).
Greenwood, J. A.: A fast machine-independent long-periodical generator for 31-bit pseudorandom integers, from Compstat 1976, Proceedings in Computational Statistics, Wien 1976.
Hammer, P. L.: Time minimizing transportation problems. Nav. Res. Log. Quart.16, 345–367 (1969);18, 487–490 (1971).
Hoare, C. A. R.: Quicksort. Comp. Journal5, 10–15 (1962).
Glover, F., Karney, D., Klingman, D.: The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems. Transportation Science6, 171–179 (1972).
Srinivasan, V., Thompson, G. L.: Accelerated algorithms for labeling and relabeling of trees, with applications to distribution problems. JACM19, 712–726 (1972).
Srinivasan, V., Thompson, G. L.: Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems. Nav. Res. Log. Quart.23, 567–595 (1976).
Swarcz, N.: Some remarks on the time transportation problem. Nav. Res. Log. Quart.18, 473–484 (1971).
Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks1, 179–194 (1972).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Derigs, U., Zimmermann, U. An augmenting path method for solving Linear Bottleneck Transportation problems. Computing 22, 1–15 (1979). https://doi.org/10.1007/BF02246556
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02246556