IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2000027.html
   My bibliography  Save this paper

Stable dynamics in transportation systems

Author

Listed:
  • NESTEROV, Yu
  • de PALMA, André

Abstract

We present a new class of transportation systems, the stable dynamics models, which provides a natural link between the static and dynamic trafic network models. They can be seen as steady states of dynamic networks (flows are constant in time). These models turn out to be very easy to study analytically for simple networks. Moreover, they can be extended for large networks, for which efficient (and standard)algorithms to solve for equilibrium can be derived. We also present a formulation for the endogenous origin-destination case. Finally, this class of models leads to very natural and simple calibration methods.

Suggested Citation

  • NESTEROV, Yu & de PALMA, André, 2000. "Stable dynamics in transportation systems," LIDAM Discussion Papers CORE 2000027, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:2000027
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2000.html
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. A. de Palma & Y. Nesterov, 1997. "Optimization formulations and static equilibrium in congested transportation networks," THEMA Working Papers 97-17, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    2. NESTEROV, Yurii, 1999. "Stable flows in transportation networks," LIDAM Discussion Papers CORE 1999007, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Ouorou, A. & Mahey, P. & Vial, P.PH., 1997. "A Survey of Algorithms for Convex Multicommodity Flow Problems," Papers 97.13, Ecole des Hautes Etudes Commerciales, Universite de Geneve-.
    4. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bliemer, Michiel C.J. & Raadsen, Mark P.H. & Smits, Erik-Sander & Zhou, Bojian & Bell, Michael G.H., 2014. "Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 363-384.
    2. A. de Palma & Y. Nesterov, 2001. "Park and Ride for the Morning and Evening Commute," THEMA Working Papers 2001-16, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    3. NESTEROV, Yu., 2003. "Characteristic functions of directed graphs and applications to stochastic equilibrium problems," LIDAM Discussion Papers CORE 2003013, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mahdi Takalloo & Changhyun Kwon, 2019. "On the Price of Satisficing in Network User Equilibria," Papers 1911.07914, arXiv.org.
    2. Fernando Ordóñez & Nicolás E. Stier-Moses, 2010. "Wardrop Equilibria with Risk-Averse Users," Transportation Science, INFORMS, vol. 44(1), pages 63-86, February.
    3. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    4. Correa, Jose R. & Schulz, Andreas S. & Stier Moses, Nicolas E., 2003. "Selfish Routing in Capacitated Networks," Working papers 4319-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. Richard Connors & David Watling, 2015. "Assessing the Demand Vulnerability of Equilibrium Traffic Networks via Network Aggregation," Networks and Spatial Economics, Springer, vol. 15(2), pages 367-395, June.
    6. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    7. Guido Gentile, 2018. "New Formulations of the Stochastic User Equilibrium with Logit Route Choice as an Extension of the Deterministic Model," Service Science, INFORMS, vol. 52(6), pages 1531-1547, December.
    8. Cipriani, Ernesto & Fusco, Gaetano, 2004. "Combined signal setting design and traffic assignment problem," European Journal of Operational Research, Elsevier, vol. 155(3), pages 569-583, June.
    9. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    10. B. Djafari Rouhani & B. Ahmadi Kakavandi, 2006. "Infinite Time-Dependent Network Equilibria with a Multivalued Cost Function," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 405-415, December.
    11. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    12. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
    13. P. Q. Khanh & L. M. Luu, 2004. "On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria," Journal of Optimization Theory and Applications, Springer, vol. 123(3), pages 533-548, December.
    14. Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
    15. Zhang, Ding & Nagurney, Anna & Wu, Jiahao, 2001. "On the equivalence between stationary link flow patterns and traffic network equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 731-748, September.
    16. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
    17. Y. W. Xu & J. H. Wu & M. Florian & P. Marcotte & D. L. Zhu, 1999. "Advances in the Continuous Dynamic Network Loading Problem," Transportation Science, INFORMS, vol. 33(4), pages 341-353, November.
    18. Belgacem Bouzaïene-Ayari & Michel Gendreau & Sang Nguyen, 2001. "Modeling Bus Stops in Transit Networks: A Survey and New Formulations," Transportation Science, INFORMS, vol. 35(3), pages 304-321, August.
    19. Vincenzo Bonifaci & Tobias Harks & Guido Schäfer, 2010. "Stackelberg Routing in Arbitrary Networks," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 330-346, May.
    20. Giulio Cantarella & Antonino Vitetta, 2006. "The multi-criteria road network design problem in an urban area," Transportation, Springer, vol. 33(6), pages 567-588, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2000027. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.