Skip to main content
SpringerLink
Log in

One-parametric bottleneck transportation problems

  • Combinatorial Optimization
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We discuss the bottleneck transportation problem with one nonlinear parameter in the bottleneck objective function. A finite sequence of feasible basic solutions which are optimal in subsequent closed parameter-intervals is generated using a primal method for the nonparametric subproblems. The best among three primal codes for solving these subproblems is selected on extensive computational comparisons. We discuss computational experience with the sequential method for the case of linear and quadratic dependence on one parameter. Observed computational behaviour is O((n ·m)α), with α⩽2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Barr, F. Glover and D. Klingman, Enhancements of spanning tree labelling procedures for network optimization, INFOR 17(1979)16.

    Google Scholar 

  2. A. Barsov,What is Linear Programming (Heath, Boston, 1964) [Russian: Moscow, 1959].

    Google Scholar 

  3. R.E. Burkard, A general Hungarian method for the algebraic transportation problem, Discrete Math. 22(1978)219.

    Google Scholar 

  4. R.E. Burkard and U. Zimmermann, The solution of algebraic assignment and transportation problems, in:Optimization and Operations Research, ed. R. Henn, B. Korte and W. Oettli, Springer Lecture Notes in Economics and Mathematical Systems 157(1978)55.

    Google Scholar 

  5. R.E. Burkard and U. Zimmermann, Weakly admissible transformations for solving algebraic assignment and transportation problems, Math. Progr. Study 12(1980)1.

    Google Scholar 

  6. U. Derigs, Engpass-Zielfunktion und Zeit/Kosten-Trade-Offs beim Transportproblem, Ph.D. thesis, Köln (1980).

  7. U. Derigs and U. Zimmermann, An augmenting path method for solving linear bottleneck transportation problems, Computing 22(1979)1.

    Google Scholar 

  8. G. Finke and P.A. Smith, Primal equivalents to the threshold algorithm, Op. Res. Verfahren 31(1979)185.

    Google Scholar 

  9. B.V. Finkel'stein, On the generalization of linear parametric programming, Econom. i. Mat. Metody 1(1965)442 (Russian).

    Google Scholar 

  10. R.S. Garfinkel and M.R. Rao, The bottleneck transportation problem, Nav. Res. Log. Quart. 18(1971)465.

    Google Scholar 

  11. B. Gavish, P. Schweitzer and E. Shlifer, The zero pivot phenomenon in transportation and assignment problems and its computational implications, Math. Progr. 12(1977)226.

    Google Scholar 

  12. F. Glover, D. Karney, D. Klingman and A. Napier, A computational study on start procedures, basis exchange criteria and solution algorithms for transportation problems, Management Science 20(1974)793.

    Google Scholar 

  13. W. Grabowski, Problem of transportation in minimum time, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 12(1964)107.

    Google Scholar 

  14. W. Grabowski, Transportation problems with minimal time (Polish), Przeglad Statyst. 11(1964)333.

    Google Scholar 

  15. W. Grabowski, Lexicographic and time minimization in the transportation problem, Zastos. Mat. 15(1976)191.

    Google Scholar 

  16. J.A. Greenwood, A fast machine-independent long-periodical generator for 31-bit pseudorandom integers, from Compstat 1976,Proc. in Computational Statistics (Wien, 1976).

  17. P.L. Hammer, Time minimizing transportation problems, Nav. Res. Log. Quart. 16(1969)345; 18(1971)487.

    Google Scholar 

  18. P.A. Jensen and J. Wesley Barnes,Network Flow Programming (Wiley, New York, 1980).

    Google Scholar 

  19. J.L. Kennington and R.V. Helgason,Algorithms for Network Flow Programming (Wiley, New York, 1980).

    Google Scholar 

  20. E.P. Nesterov,Transportation Problems in Linear Programming (Russian) (Moscow, 1962).

  21. H.P. Pasch, Nonlinear one-parametric minimal cost network flow problems, Report 81-11, Mathematisches Institut, Universität zu Köln (1981).

  22. I.S. Schubert, Einparametrische lineare Optimierung mit Anwendung auf das Bottleneck-Transportproblem, Diplom thesis, Mathematisches Institut der Universität zu Köln (1983).

  23. I.S. Schubert and U. Zimmermann, Nonlinear one-parametric bottleneck linear programming, Zeitschrift für Operations Research 29(1985)187.

    Google Scholar 

  24. V. Srinivasan and G.L. Thompson, Benefit-cost analysis of coding techniques for the primal transportation algorithm, J. Assoc. Comp. Mach. 20(1973)194.

    Google Scholar 

  25. V. Srinivasan and G.L. Thompson, Algorithms for minimizing total cost bottleneck time and bottleneck shipment in transportation problems, Nav. Res. Log. Quart. 23(1976)567.

    Google Scholar 

  26. W. Szwarc, The time transportation problem, Zastos. Mat. 8(1966)231.

    Google Scholar 

  27. W. Szwarc, Some remarks on the time transportation problem, Nav. Res. Log. Quart. 18(1971)473.

    Google Scholar 

  28. A. Wüstefeld and U. Zimmermann, Nonlinear one-parametric linear programming andt-norm transportation problems, Nav. Res. Log. Quart. 27(1980)187.

    Google Scholar 

  29. U. Zimmermann, A primal method for solving algebraic transportation problems applied to the bottleneck transportation problem, in:Proc. of the Polish-Danish Mathematical Programming Seminar, ed. J. Krarup and S. Walukiewicz (Instytut Badan Systemowych, Polska Akademia Nauk, Warsaw, 1978) p. 139.

    Google Scholar 

  30. U. Zimmermann, Duality principles and the algebraic transportation problem, in:Numerische Methoden bei graphentheoretischen Problemen, ed. L. Collatz, G. Meinardus and W. Wetterling (Birkhäuser, Basel 2, 1979) p. 234.

    Google Scholar 

  31. U. Zimmermann, Linear optimization for linear and bottleneck objectives with one nonlinear parameter, in:Optimization Techniques, ed. K. Iracki, K. Malanowski and S. Walukiewicz, Springer Lecture Notes in Control and Information Sciences 23(1980)211.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Universität Kaiserlautern, Postfach 3049, D-6750, Kaiserslautern, Germany

    I. S. Schubert & U. Zimmermann

Authors
  1. I. S. Schubert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. U. Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schubert, I.S., Zimmermann, U. One-parametric bottleneck transportation problems. Ann Oper Res 4, 343–369 (1985). https://doi.org/10.1007/BF02022047

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02022047

Keywords and phrases

Search

Navigation