Skip to main content
SpringerLink
Log in

A branch-and-bound/flow-equilbrium algorithm for the approximate solution of total cost minimization problems in traffic networks

  • Analytical Techniques
  • Published:
Papers of the Regional Science Association

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

References

  1. Balinski, M. L. “Fixed Cost Transportation Problems,”Naval Research Logistic Quarterly, Vol. 8 (1961), pp. 41–54.

    Google Scholar 

  2. Beale, E. M. L. and R. E. Small. “Mixed Integer Programming by a Branch and Bound Technique,”Proc. IFIP Congress 65, Vol. 2 (1966), pp. 450–451.

    Google Scholar 

  3. Boyce, D. E., A. Farhi and R. Weischedel, “Optimal Network Problem: A Branch-and-Bound Algorithm,”Environment and Planning, Vol. 5 (1973), pp. 519–533.

    Google Scholar 

  4. , A. Farhi and R. Weischedel.Optimal Subset Selection. Multiple Regression, Interdependence and Optimal Network Algorithms. Berlin: Springer, 1974.

    Google Scholar 

  5. Busacker, R. G. and T. L. Saaty.Endliche Graphen und Netzwerke, Munich: Oldenbourg, 1968.

    Google Scholar 

  6. Dafermos, S. C. and F. T. Sparrow. “The Traffic Assignment Problem for a General Network,”Journal of Research of the National Bureau of Standards-B. Mathematical Sciences, Vol. 738 (1969), No. 2, pp. 91–118.

    Google Scholar 

  7. Dantzig, G. B., S. F. Maier and Z. F. Lansdowne. The Application of Decomposition to Transportation Network Analysis, Interim Report prepared for U.S. Department of Transportation, Washington, D.C., 1976.

  8. —, R. P. Harvey, Z. F. Lansdowne, S. F. Maier, and D. W. Robinson, “A Convex Network Design Model Based on a Decomposition Procedure,” G. S. B. A. Working Paper No. 215, Graduate School of Business Administration, Duke University, Durham, 1977.

    Google Scholar 

  9. Dehnert, G.Standortplanung für Abfallbehandlungsanlagen. Regionale Planung mit Hilfe graphentheoretischer Algorithmen. Bielefeld: Schmidt, 1976.

    Google Scholar 

  10. Domschke, W. “Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen,”Computing, Vol. 11 (1973), pp. 125–136 and 169–173.

    Google Scholar 

  11. —Graphentheoretische Verfahren und ihre Anwendung zur Lösung von Zuordnungsund Standortproblemen. Habilitationsschrift, Universität Karlsruhe, Karlsruhe, 1974.

    Google Scholar 

  12. Florian, M. (ed.).Traffic Equilibrium Methods. Berlin: Springer, 1976.

    Google Scholar 

  13. Forrest, J. J. H., J. P. H. Hirst and J. A. Tomlin “Practical Solution of Large Mixed Integer Programming Problems with Umpire,”Management Science, Vol. 20 (1974), pp. 736–773.

    Google Scholar 

  14. Gauthier, J.-M. and G. Ribière. “Experiments in Mixed-Integer Linear Programming Using Pseudo-Costs,”Mathematical Programming, Vol. 12 (1977), pp. 26–47.

    Google Scholar 

  15. Khumawala, B. M. “An Efficient Branch and Bound Algorithm for the Warehouse Location Problem,”Management Science, Vol. 18 (1972), pp. B718-B731.

    Google Scholar 

  16. Land, A. W. and A. G. Doig. “An Automatic Method for Solving Discrete Programming Problems,”Econometrica, Vol. 28 (1960), pp. 497–520.

    Google Scholar 

  17. Le Blanc, L. J. “An Algorithm for the Discrete Network Design Problem,”Transportation Science, Vol. 9 (1975), pp. 183–199.

    Google Scholar 

  18. Müller-Merbach, H. “Heuristic Procedures for Solving Combinatorial Optimization Problems in Transportation,”Transportation Research, Vol. 10 (1976), pp. 377–378.

    Google Scholar 

  19. Nguyen, S. “An Algorithm for the Traffic Assignment Problem,”Transportation Science, Vol. 8 (1974), pp. 203–216.

    Google Scholar 

  20. Pearman, A. “A Heuristic Algorithm for the Optimal Network Problem,” unpublished Discussion Paper. School of Economic Studies, University of Leeds, Leeds, 1977.

    Google Scholar 

  21. Ridley, T. M. “Reducing the Travel Time in a Transport Network,”London Papers in Regional Science, London: Pion, 1969, pp. 73–87.

    Google Scholar 

  22. Roberts, P. O.Transport Planning: Models for Developing Countries, Ph.D. Thesis, Dept. of Civ. Eng., Northwestern University, Evanston, 1966.

    Google Scholar 

  23. Rothengatter, W. “Planning of Road Investment in Metropolitan Areas — An Approach by Mixed-Integer Programming,” Discussion Paper to the 2nd Summer Institute on Regional Science, 1972, to appear in:Karlsruhe Papers in Regional Science, Vol. 3, London: Pion.

  24. Sahling, B. M.Verkehrsablauf in Netzen — Ein graphentheoretisches Optimierungs verfahren-. Diss. an der Universität Karlsruhe (TH), Karlsruhe, 1977.

  25. Steenbrink, P. A.Optimization of Transport Networks, London, New York, Sidney, Toronto: John Wiley, 1974.

    Google Scholar 

  26. Ventker, R.Die ökonomischenGrundlagen der Verkehrsnetzplanung, Göttingen: Vandenhoeck & Ruprecht, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Wirtschaftspolitik und Wirtschaftsforschung, University of Karlsruhe, W. Germany

    Harry Böttcher & Werner Rothengatter

  2. Institut für Verkehrswesen, University of Karlsruhe, W. Germany

    Bernd-Michael Sahling

Authors
  1. Harry Böttcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Rothengatter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernd-Michael Sahling
    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

Böttcher, H., Rothengatter, W. & Sahling, BM. A branch-and-bound/flow-equilbrium algorithm for the approximate solution of total cost minimization problems in traffic networks. Papers of the Regional Science Association 42, 153–175 (1979). https://doi.org/10.1007/BF01935151

Download citation

  • Issue Date:

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

Keywords

Search

Navigation