IDEAS home Printed from https://ideas.repec.org/p/ema/worpap/2001-19.html
   My bibliography  Save this paper

Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives

Author

Listed:
  • A. de Palma
  • Y. Nesterov

Abstract

No abstract is available for this item.

Suggested Citation

  • A. de Palma & Y. Nesterov, 2001. "Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives," THEMA Working Papers 2001-19, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    • Handle: RePEc:ema:worpap:2001-19
    as

    Download full text from publisher

    File URL: http://www.u-cergy.fr/IMG/documents//2001-19DePalma.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    2. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    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. Ke Han & Terry L. Friesz, 2017. "Continuity of the Effective Delay Operator for Networks Based on the Link Delay Model," Networks and Spatial Economics, Springer, vol. 17(4), pages 1095-1110, December.
    3. André de Palma & Claude Lefèvre, 2018. "Bottleneck models and departure time problems," Working Papers hal-01581519, HAL.
    4. Meruza Kubentayeva & Alexander Gasnikov, 2021. "Finding Equilibria in the Traffic Assignment Problem with Primal-Dual Gradient Methods for Stable Dynamics Model and Beckmann Model," Mathematics, MDPI, vol. 9(11), pages 1-17, May.
    5. Evgenia Gasnikova & Alexander Gasnikov & Yaroslav Kholodov & Anastasiya Zukhba, 2023. "An Evolutionary View on Equilibrium Models of Transport Flows," Mathematics, MDPI, vol. 11(4), pages 1-8, February.
    6. repec:wsi:jeapmx:v:20:y:2018:i:04:n:s0219198918500068 is not listed on IDEAS
    7. Bliemer, Michiel C.J. & Raadsen, Mark P.H., 2020. "Static traffic assignment with residual queues and spillback," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 303-319.
    8. Smith, Mike & Huang, Wei & Viti, Francesco & Tampère, Chris M.J. & Lo, Hong K., 2019. "Quasi-dynamic traffic assignment with spatial queueing, control and blocking back," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 140-166.
    9. Koohyun Park, 2011. "Detecting Braess Paradox Based on Stable Dynamics in General Congested Transportation Networks," Networks and Spatial Economics, Springer, vol. 11(2), pages 207-232, June.

    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. Jaume Barceló, 1997. "A survey of some mathematical programming models in transportation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 1-40, June.
    2. Jiayang Li & Qianni Wang & Liyang Feng & Jun Xie & Yu Marco Nie, 2024. "A Day-to-Day Dynamical Approach to the Most Likely User Equilibrium Problem," Papers 2401.08013, arXiv.org.
    3. Sylvain Sorin, 2023. "Continuous Time Learning Algorithms in Optimization and Game Theory," Dynamic Games and Applications, Springer, vol. 13(1), pages 3-24, March.
    4. Joaquín De Cea & J. Enrique Fernández & Valérie Dekock & Alexandra Soto, 2004. "Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes," Transport Reviews, Taylor & Francis Journals, vol. 25(3), pages 293-317, January.
    5. Guillaume Sagnol & Edouard Pauwels, 2019. "An unexpected connection between Bayes A-optimal designs and the group lasso," Statistical Papers, Springer, vol. 60(2), pages 565-584, April.
    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. Abdelfettah Laouzai & Rachid Ouafi, 2022. "A prediction model for atmospheric pollution reduction from urban traffic," Environment and Planning B, , vol. 49(2), pages 566-584, February.
    8. Anna Nagurney & Qiang Qiang, 2008. "An efficiency measure for dynamic networks modeled as evolutionary variational inequalities with application to the Internet and vulnerability analysis," Netnomics, Springer, vol. 9(1), pages 1-20, January.
    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. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    11. Ran, Bin & Hall, Randolph & Boyce, David E., 1995. "A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt84t190b3, Institute of Transportation Studies, UC Berkeley.
    12. 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.
    13. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
    14. Francesco Rinaldi & Damiano Zeffiro, 2023. "Avoiding bad steps in Frank-Wolfe variants," Computational Optimization and Applications, Springer, vol. 84(1), pages 225-264, January.
    15. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    16. Friesz, Terry L. & Tourreilles, Francisco A. & Han, Anthony Fu-Wha, 1979. "Multi-Criteria Optimization Methods in Transport Project Evaluation: The Case of Rural Roads in Developing Countries," Transportation Research Forum Proceedings 1970s 318817, Transportation Research Forum.
    17. Xiaoming Yuan, 2011. "An improved proximal alternating direction method for monotone variational inequalities with separable structure," Computational Optimization and Applications, Springer, vol. 49(1), pages 17-29, May.
    18. Hideo Konishi, 2004. "Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters," Transportation Science, INFORMS, vol. 38(3), pages 315-330, August.
    19. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    20. Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2019. "Mass Customization and “Forecasting Options’ Penetration Rates Problem”," Operations Research, INFORMS, vol. 67(4), pages 1120-1134, July.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:ema:worpap:2001-19. 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: Stefania Marcassa (email available below). General contact details of provider: https://edirc.repec.org/data/themafr.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.