IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i1d10.1007_s10287-023-00494-8.html
   My bibliography  Save this article

Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints

Author

Listed:
  • Meruza Kubentayeva

    (Moscow Institute of Physics and Technology)

  • Demyan Yarmoshik

    (Moscow Institute of Physics and Technology)

  • Mikhail Persiianov

    (Moscow Institute of Physics and Technology
    Institute for Information Transmission Problems RAS)

  • Alexey Kroshnin

    (Institute for Information Transmission Problems RAS
    Higher School of Economics)

  • Ekaterina Kotliarova

    (Moscow Institute of Physics and Technology)

  • Nazarii Tupitsa

    (Moscow Institute of Physics and Technology)

  • Dmitry Pasechnyuk

    (Moscow Institute of Physics and Technology)

  • Alexander Gasnikov

    (Moscow Institute of Physics and Technology
    Institute for Information Transmission Problems RAS
    Higher School of Economics)

  • Vladimir Shvetsov

    (Moscow Institute of Physics and Technology
    Russian University of Transport)

  • Leonid Baryshev

    (Russian University of Transport)

  • Alexey Shurupov

    (Russian University of Transport)

Abstract

We consider a network equilibrium model (i.e. a combined model), which was proposed as an alternative to the classic four-step approach for travel forecasting in transportation networks. This model can be formulated as a convex minimization program. We extend the combined model to the case of the stable dynamics model in the traffic assignment stage, which imposes strict capacity constraints in the network. We propose a way to solve corresponding dual optimization problems with accelerated gradient methods and give theoretical guarantees of their convergence. We conducted numerical experiments with considered optimization methods on Moscow and Berlin networks.

Suggested Citation

  • Meruza Kubentayeva & Demyan Yarmoshik & Mikhail Persiianov & Alexey Kroshnin & Ekaterina Kotliarova & Nazarii Tupitsa & Dmitry Pasechnyuk & Alexander Gasnikov & Vladimir Shvetsov & Leonid Baryshev & A, 2024. "Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints," Computational Management Science, Springer, vol. 21(1), pages 1-33, June.
  • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00494-8
    DOI: 10.1007/s10287-023-00494-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00494-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10287-023-00494-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. T. Abrahamsson & L. Lundqvist, 1999. "Formulation and Estimation of Combined Network Equilibrium Models with Applications to Stockholm," Transportation Science, INFORMS, vol. 33(1), pages 80-100, February.
    2. Enrique Fernandez & Joaquin de Cea & Michael Florian & Enrique Cabrera, 1994. "Network Equilibrium Models with Combined Modes," Transportation Science, INFORMS, vol. 28(3), pages 182-192, August.
    3. Fukushima, Masao, 1984. "A modified Frank-Wolfe algorithm for solving the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 169-177, April.
    4. Larry J. LeBlanc & Richard V. Helgason & David E. Boyce, 1985. "Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs," Transportation Science, INFORMS, vol. 19(4), pages 445-462, November.
    5. Y. Arezki & D. Van Vliet, 1990. "A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment," Transportation Science, INFORMS, vol. 24(1), pages 58-62, February.
    6. 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.
    7. NESTEROV, Yurii, 2015. "Universal gradient methods for convex optimization problems," LIDAM Reprints CORE 2701, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Taesung Hwang, 2021. "Assignment of Freight Truck Shipment on the U.S. Highway Network," Sustainability, MDPI, vol. 13(11), pages 1-11, June.
    3. Chi Xie & Xing Wu & Stephen Boyles, 2019. "Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account," Annals of Operations Research, Springer, vol. 273(1), pages 279-310, February.
    4. Maria Mitradjieva & Per Olov Lindberg, 2013. "The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment ," Transportation Science, INFORMS, vol. 47(2), pages 280-293, May.
    5. 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.
    6. 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).
    7. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    8. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    9. Tao Zhang & Yang Yang & Gang Cheng & Minjie Jin, 2020. "A Practical Traffic Assignment Model for Multimodal Transport System Considering Low-Mobility Groups," Mathematics, MDPI, vol. 8(3), pages 1-19, March.
    10. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    11. A. Karakitsiou & A. Migdalas, 2016. "Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method," Operational Research, Springer, vol. 16(3), pages 401-421, October.
    12. Oyama, Yuki & Hara, Yusuke & Akamatsu, Takashi, 2022. "Markovian traffic equilibrium assignment based on network generalized extreme value model," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 135-159.
    13. Jayakrishnan, R. & Tsai, Wei K. & Oh, Jun-Seok & Adler, Jeffrey, 1999. "Event-based ATIS: Practical Implementation and Evaluation of Optimized Strategies (Part I)," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt0hz5n8x2, Institute of Transportation Studies, UC Berkeley.
    14. Li, Li & Li, Xiaopeng, 2019. "Parsimonious trajectory design of connected automated traffic," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 1-21.
    15. Benjamin Grimmer, 2023. "General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth Bounds," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 51-70, April.
    16. Marta Rojo, 2020. "Evaluation of Traffic Assignment Models through Simulation," Sustainability, MDPI, vol. 12(14), pages 1-19, July.
    17. David Di Lorenzo & Alessandro Galligari & Marco Sciandrone, 2015. "A convergent and efficient decomposition method for the traffic assignment problem," Computational Optimization and Applications, Springer, vol. 60(1), pages 151-170, January.
    18. Yuan, Yun & Yu, Jie, 2018. "Locating transit hubs in a multi-modal transportation network: A cluster-based optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 85-103.
    19. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    20. 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.

    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:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00494-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.