IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v174y2023ics1366554523000996.html
   My bibliography  Save this article

A novel flow update policy in solving traffic assignment problems: Successive over relaxation iteration method

Author

Listed:
  • Zhang, Honggang
  • Liu, Zhiyuan
  • Wang, Jian
  • Wu, Yunchi

Abstract

This paper presents a novel flow update policy, namely the successive over relaxation (SOR) iteration method, which can be implemented in traffic assignment algorithms. Most existing solution algorithms for the user equilibrium traffic assignment problem (UE-TAP) mainly use two flow update policies: Jacobi and Gauss-Seidel iteration methods. The proposed flow update policy SOR can be a more efficient replacement. Following the path-based gradient projection (GP) algorithm, we developed a new method GP-SOR for the UE-TAP. This study first provides the complete procedure of applying the GP-SOR algorithm to solve the UE-TAP. Subsequently, a few properties of the proposed method are rigorously proven. However, empirical tests of the GP-SOR algorithm demonstrate serious oscillations and poor convergence. To cope with this problem, the Armijo Rule is employed to determine the relaxation factor, which substantially improves the convergence of GP-SOR algorithm. The preliminary numerical examples show that the GP-SOR algorithm has speedier convergence compared with the known alternatives, which is reflected by the evident reduction of the computing time and the number of iterations.

Suggested Citation

  • Zhang, Honggang & Liu, Zhiyuan & Wang, Jian & Wu, Yunchi, 2023. "A novel flow update policy in solving traffic assignment problems: Successive over relaxation iteration method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    • Handle: RePEc:eee:transe:v:174:y:2023:i:c:s1366554523000996
    DOI: 10.1016/j.tre.2023.103111
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554523000996
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2023.103111?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. 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.
    2. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    3. Wilhelm Niethammer, 2001. "The Successive Over Relaxation Method (SOR) and Markov Chains," Annals of Operations Research, Springer, vol. 103(1), pages 351-358, March.
    4. Cheng, Qixiu & Liu, Zhiyuan & Lin, Yuqian & Zhou, Xuesong (Simon), 2021. "An s-shaped three-parameter (S3) traffic stream model with consistent car following relationship," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 246-271.
    5. Huo, Jinbiao & Liu, Zhiyuan & Chen, Jingxu & Cheng, Qixiu & Meng, Qiang, 2023. "Bayesian optimization for congestion pricing problems: A general framework and its instability," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 1-28.
    6. 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.
    7. Zhang, Fang & Lu, Jian & Hu, Xiaojian, 2022. "Integrated path controlling and subsidy scheme for mobility and environmental management in automated transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    8. 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.
    9. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    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. 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.
    12. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    13. Huang, Ruqing & Han, Lee D. & Huang, Zhongxiang, 2022. "A new network equilibrium flow model: User-equilibrium with quantity adjustment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    14. Dial, Robert B., 2006. "A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 917-936, December.
    15. 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).
    16. 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.
    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. 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).

    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. 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).
    2. 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.
    3. 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).
    4. 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.
    5. Jafari, Ehsan & Pandey, Venktesh & Boyles, Stephen D., 2017. "A decomposition approach to the static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 270-296.
    6. 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.
    7. 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.
    8. Smith, Mike & Mounce, Richard, 2011. "A splitting rate model of traffic re-routeing and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1389-1409.
    9. Hong Zheng, 2015. "Adaptation of Network Simplex for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 49(3), pages 543-558, August.
    10. Jun Xie & Yu (Marco) Nie, 2019. "A New Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment," Transportation Science, INFORMS, vol. 53(2), pages 566-584, March.
    11. Bar-Gera, Hillel & Boyce, David & Nie, Yu (Marco), 2012. "User-equilibrium route flows and the condition of proportionality," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 440-462.
    12. Wang, Xiaolei & Wang, Jun & Guo, Lei & Liu, Wei & Zhang, Xiaoning, 2021. "A convex programming approach for ridesharing user equilibrium under fixed driver/rider demand," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 33-51.
    13. Xie, Jun & Nie, Yu (Marco) & Yang, Xiaoguang, 2013. "Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 15-30.
    14. Jaller, Miguel & Pahwa, Anmol & Zhang, Michael, 2021. "Cargo Routing and Disadvantaged Communities," Institute of Transportation Studies, Working Paper Series qt9qg2318x, Institute of Transportation Studies, UC Davis.
    15. 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.
    16. Jafari, Ehsan & Boyles, Stephen D., 2016. "Improved bush-based methods for network contraction," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 298-313.
    17. 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.
    18. Rui Yao & Shlomo Bekhor, 2023. "A general equilibrium model for multi-passenger ridesharing systems with stable matching," Papers 2303.16595, arXiv.org, revised Dec 2023.
    19. Yao, Rui & Bekhor, Shlomo, 2023. "A general equilibrium model for multi-passenger ridesharing systems with stable matching," Transportation Research Part B: Methodological, Elsevier, vol. 175(C).
    20. Rinaldi, Marco & Tampère, Chris M.J. & Viti, Francesco, 2018. "On characterizing the relationship between route choice behaviour and optimal traffic control solution space," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 892-906.

    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:transe:v:174:y:2023:i:c:s1366554523000996. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/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.