Skip to main content

A System Optimal Traffic Assignment Model with Distributed Parameters

  • Conference paper
Advanced Methods in Transportation Analysis

Part of the book series: Transportation Analysis ((TRANSANALY))

Abstract

In this paper a multidestination system optimal dynamic traffic assignment model with distributed parameters is examined. This model can be considered an extension of previous and well known models such as those of Merchant and Nemhauser (1978) and Friesz (1990). Flow dynamics of the model is based on an extension of the simple continuum model for flows composed by several commodities with equal propagation characteristics. An important property of flows following this model is that no overtaking can occur between flows of different commodities. In the case of flow propagating at constant speed and vertical queues at the end of links it is possible the stable approximation of the proposed dynamic system optimal model by means of optimal control problems. For one of the possible stable, approximations it is shown how a strengthened Courant-Friedrichs-Levy condition ensures no overtaking and FIFO observance at vertical queues of the approximating optimal control problem. Finally, and for the case of a single destination in the network, the application of an extremals calculation method for optimal control problems developed by the authors in previous papers is also shown and favorable conditions for its application are discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Anderson D.A., Tannehill J.C., Pletcher R.H (1984) “Computational Fluid Mechanics and Heat, Transfer”,Hemisphere Publishing Corporation 1984.

    Google Scholar 

  2. Carey M. (1986), “A Constraint Qualification for a Dynamic Traffic Assignment Model”,Transportation Science 20, pp 55–58.

    Article  Google Scholar 

  3. Carey M. (1987), “Optimal Time-Varying Flows on Congested Networks”,Operations Research Vol.35, No 1, January-February 1987.

    Google Scholar 

  4. Carey M. (1991), “Nonconvexity of the Dynamic Assignment Problem”,Transpn Res.B Vol 26B, No 2, pp. 127–133.

    Article  Google Scholar 

  5. Codina E., Barceló J. (1992), “Extremals Calculation for the Dynamic Traffic Assignment Problem”,Presented at 39th North American Meeting of the RSAI Chicago USA 1992.

    Google Scholar 

  6. Codina E., Barceló J. (1992), “Dynamic Traffic Assignment: An Annotated Review of Modelling and Algorithmic Approaches”, Universitat Politècnica de Catalunya. Departament d’Estadistica i Investigació Operativa, Document de Recerca DR 94–01.

    Google Scholar 

  7. Codina E. (1993), “Un Algoritmo para Problemas de Control Optimo y su Aplicación a la Asignación Dinámica de Tráfico”,Tesis Doctoral. Universitat Politècnica de Catalunya, Departament d’Estadfstica i Investigació Operativa.

    Google Scholar 

  8. T.L. Friesz, F.J. Luque, R.L. Tobin, B.W. Wie (1989), “DynamiC Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem”,Op. Research Vol 37–6 pags 58–69 USA.

    Google Scholar 

  9. Merchant D.K., Nemhauser G.L. (1978), “A Model and an Algorithm for the Dynamic Traffic Assignment Problems”,Transportation Science Vol.12 No 3 August 1978.

    Google Scholar 

  10. Merchant D.K., Nemhauser G.L. (1978),“Optimal Conditions for Dynamic Traffic Assignment Model”,Transportation Science Vol.12 No 3 August 1978.

    Google Scholar 

  11. Mitchel A.R., Griffiths D.F. (1980), “The Finite Difference Method in Partial Differential Equations”,John Wiley and Sons New York (1990).

    Google Scholar 

  12. Papageorgiou M. (1989), “Dynamic Modeling, Assignment, and Route Guidance in Traffic Networks”,Transpn Res. Vol 24B, No 6, pp. 471–495 (1990), From US Italy Joint Seminar Preprints at Capri June (1989).

    Google Scholar 

  13. Ran B., David E.B., LeBlanc L.J. (1990), “A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models”,Operations Research Vol. 41, No. 1993.

    Google Scholar 

  14. Shames I.H. (1962), “Fluid Mechanics”,Mac Graw Hill (1962).

    Google Scholar 

  15. B.W. Wie, T.L. Friesz, R.L. Tobin (1990), “Dynamic User Optimal Traffic Assignment on Congested, Multidestination Networks”,Transportation Research 24B 6 December 1990.

    Google Scholar 

  16. Zangwill W.I. (1969), “Nonlinear Programming: A Unified Approach”Prentice-Hall, Englewood Cliffs NJ, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin. Heidelberg

About this paper

Cite this paper

Codina, E., Barceló, J. (1996). A System Optimal Traffic Assignment Model with Distributed Parameters. In: Bianco, L., Toth, P. (eds) Advanced Methods in Transportation Analysis. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85256-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85256-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-85258-9

  • Online ISBN: 978-3-642-85256-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics