IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v18y1984i2p169-177.html
   My bibliography  Save this article

A modified Frank-Wolfe algorithm for solving the traffic assignment problem

Author

Listed:
  • Fukushima, Masao

Abstract

This paper presents a very simple modification of the Frank-Wolfe algorithm for the solution of the traffic assignment problem. It is shown that the modified algorithm can be implemented without much increase in computational effort over the original one. Convergence of the algorithm is proved and computational results are reported to demonstrate the validity of the modification.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:18:y:1984:i:2:p:169-177
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(84)90029-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. 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.
    2. Liu, Zhiyuan & Zhang, Honggang & Zhang, Kai & Zhou, Zihan, 2023. "Integrating alternating direction method of multipliers and bush for solving the traffic assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    3. 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.
    4. Ximing Wang & Panos M. Pardalos, 2017. "A modified active set algorithm for transportation discrete network design bi-level problem," Journal of Global Optimization, Springer, vol. 67(1), pages 325-342, January.
    5. 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).
    6. Zijun Wu & Rolf H. Möhring & Yanyan Chen & Dachuan Xu, 2021. "Selfishness Need Not Be Bad," Operations Research, INFORMS, vol. 69(2), pages 410-435, March.
    7. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    8. He, Zhidong & Navneet, Kumar & van Dam, Wirdmer & Van Mieghem, Piet, 2021. "Robustness assessment of multimodal freight transport networks," Reliability Engineering and System Safety, Elsevier, vol. 207(C).
    9. Liu, Zhiyuan & Chen, Xinyuan & Hu, Jintao & Wang, Shuaian & Zhang, Kai & Zhang, Honggang, 2023. "An alternating direction method of multipliers for solving user equilibrium problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1072-1084.
    10. 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.
    11. Liu, Jiangtao & Zhou, Xuesong, 2019. "Observability quantification of public transportation systems with heterogeneous data sources: An information-space projection approach based on discretized space-time network flow models," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 302-323.
    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. Taesung Hwang, 2021. "Assignment of Freight Truck Shipment on the U.S. Highway Network," Sustainability, MDPI, vol. 13(11), pages 1-11, June.
    14. 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.
    15. Xie, Chi, 2016. "New insights and improvements of using paired alternative segments for traffic assignmentAuthor-Name: Xie, Jun," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 406-424.
    16. Li, Li & Li, Xiaopeng, 2019. "Parsimonious trajectory design of connected automated traffic," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 1-21.
    17. Yingliang Zhou & Qiwei Jiang & Jin Qin, 2019. "Pre-Disaster Retrofit Decisions for Sustainable Transportation Systems in Urban Areas," Sustainability, MDPI, vol. 11(15), pages 1-18, July.
    18. Esfandeh, Tolou & Kwon, Changhyun & Batta, Rajan, 2016. "Regulating hazardous materials transportation by dual toll pricing," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 20-35.
    19. 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.

    More about this item

    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:eee:transb:v:18:y:1984:i:2:p:169-177. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.