IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v36y2002i4p398-417.html
   My bibliography  Save this article

Origin-Based Algorithm for the Traffic Assignment Problem

Author

Listed:
  • Hillel Bar-Gera

    (Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Be'er-Sheva 84105, Israel)

Abstract

We present an origin-based algorithm for the traffic assignment problem, which is similar conceptually to the algorithm proposed by Gallager and Bertsekas for routing in telecommunication networks. Apart from being origin-based, the algorithm is different from other algorithms used so far for the traffic assignment problem by its restriction to acyclic solutions and by the use of approach proportions as solution variables. Projected quasi-Newton search directions are used to shift flows effectively and to eliminate residual flows. Experimental results comparing the proposed algorithm with the state-of-the-practice algorithm of Frankand Wolfe demonstrate the algorithm's excellent convergence performance, especially when highly accurate solutions are needed. Reasonable memory requirements make this algorithm applicable to large-scale networks. The resulting solution has an immediate route flow interpretation, thus providing equivalent detail to route-based solutions.

Suggested Citation

  • Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    • Handle: RePEc:inm:ortrsc:v:36:y:2002:i:4:p:398-417
    DOI: 10.1287/trsc.36.4.398.549
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.36.4.398.549
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.36.4.398.549?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
    ---><---

    References listed on IDEAS

    as
    1. Jayakrishnan, R. & Tsai, Wei T. & Prashker, Joseph N. & Rajadhyaksha, Subodh, 1994. "A Faster Path-Based Algorithm for Traffic Assignment," University of California Transportation Center, Working Papers qt2hf4541x, University of California Transportation Center.
    2. 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.
    3. Torbjörn Larsson & Michael Patriksson, 1992. "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 26(1), pages 4-17, February.
    4. 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.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Taesung Hwang, 2021. "Assignment of Freight Truck Shipment on the U.S. Highway Network," Sustainability, MDPI, vol. 13(11), pages 1-11, June.
    7. 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.
    8. 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.
    9. 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).
    10. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    11. 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).
    12. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    13. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    14. 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.
    15. Bai, Yun & Hwang, Taesung & Kang, Seungmo & Ouyang, Yanfeng, 2011. "Biofuel refinery location and supply chain planning under traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 162-175, January.
    16. 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.
    17. Takashi Akamatsu, 2001. "An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues," Transportation Science, INFORMS, vol. 35(4), pages 389-404, November.
    18. Bekhor, Shlomo & Toledo, Tomer, 2005. "Investigating path-based solution algorithms to the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 279-295, March.
    19. Yu (Marco) Nie, 2012. "A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem," Transportation Science, INFORMS, vol. 46(1), pages 27-38, February.
    20. 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).

    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:inm:ortrsc:v:36:y:2002:i:4:p:398-417. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.