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

A novel parallel computing framework for traffic assignment problem: Integrating alternating direction method of multipliers with Jacobi over relaxation method

Author

Listed:
  • Liu, Zhiyuan
  • Dong, Yu
  • Zhang, Honggang
  • Zheng, Nan
  • Huang, Kai

Abstract

Traffic assignment plays a crucial role in transport system analysis, and the user equilibrium model is a very essential tool. It is however highly challenging to efficiently solve the user equilibrium model, especially for large-scale networks. Taking the deterministic user equilibrium (DUE) model as a representative, this paper aims to harness parallel computing to tackle its high computing burden. A novel parallel computing framework is proposed, drawing from the frontier alternating direction method of multipliers (ADMM) method. This algorithmic framework takes a good balance between the convergence rate and the additional communication costs. Specifically, the paper incorporates insights from the Jacobi over-relaxation (JOR) iteration method into the framework of the ADMM method, improving the convergence rate by utilizing more information during the iteration process while striving to reduce the side effects it brings, thereby developing a novel parallel computing framework, named ADMM-JOR. Subsequently, convergence of the proposed algorithm is rigorously proven under an analytic framework of contractive-type methods. Furthermore, we develop an adaptive strategy for adjusting the relaxation factor in ADMM-JOR, guided by the principle of objective function value decline, which aims to further improve the convergence performance of ADMM-JOR, with minimal additional computational cost in a fully parallel setting. Numerical experiments indicate that the proposed ADMM-JOR significantly reduces computation time while retaining the excellent parallel performance of the original ADMM method and significantly improving its convergence rate.

Suggested Citation

  • Liu, Zhiyuan & Dong, Yu & Zhang, Honggang & Zheng, Nan & Huang, Kai, 2024. "A novel parallel computing framework for traffic assignment problem: Integrating alternating direction method of multipliers with Jacobi over relaxation method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).
    • Handle: RePEc:eee:transe:v:189:y:2024:i:c:s1366554524002783
    DOI: 10.1016/j.tre.2024.103687
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524002783
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103687?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. 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.
    2. B. S. He & H. Yang & S. L. Wang, 2000. "Alternating Direction Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 106(2), pages 337-356, August.
    3. 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.
    4. 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.
    5. Wu, Gang & Xiang, Yue & Liu, Junyong & Gou, Jing & Shen, Xiaodong & Huang, Yuan & Jawad, Shafqat, 2020. "Decentralized day-ahead scheduling of multi-area integrated electricity and natural gas systems considering reserve optimization," Energy, Elsevier, vol. 198(C).
    6. 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.
    7. Jianlin Jiang & Liyun Ling & Yan Gu & Su Zhang & Yibing Lv, 2023. "Customized Alternating Direction Methods of Multipliers for Generalized Multi-facility Weber Problem," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 362-389, January.
    8. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    9. Yu-Hong Dai & Fangfang Xu & Liwei Zhang, 2023. "Alternating direction method of multipliers for linear hyperspectral unmixing," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 289-310, June.
    10. 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).
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    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. Li, Zhengyang & Li, Guoyuan & Xu, Zhandong & Chen, Anthony, 2023. "Multiclass bi-criteria traffic assignment without class-specific variables: An alternative formulation and a subgradient projection algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    17. 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).
    18. Xu, Zhandong & Chen, Anthony & Li, Guoyuan & Li, Zhengyang & Liu, Xiaobo, 2024. "Elastic-demand bi-criteria traffic assignment under the continuously distributed value of time: A two-stage gradient projection algorithm with graphical interpretations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    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. 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. 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).
    4. 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).
    5. Zhang, Honggang & Liu, Zhiyuan & Dong, Yu & Zhou, Hongyue & Liu, Pan & Chen, Jun, 2024. "A novel network equilibrium model integrating urban aerial mobility," Transportation Research Part A: Policy and Practice, Elsevier, vol. 187(C).
    6. Feng, Liyang & Xie, Jun & Liu, Xiaobo & Tang, Youhua & Wang, David Z.W. & Nie, Yu (Marco), 2024. "Is order-2 proportionality good enough for approximating the most likely path flow in user equilibrium traffic assignment?," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    7. 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.
    8. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    9. Liu, Zhiyuan & Xie, Shen & Zhang, Honggang & Zhou, Dinghao & Yang, Yuwei, 2024. "A parallel computing framework for large-scale microscopic traffic simulation based on spectral partitioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    10. 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.
    11. Rambha, Tarun & Boyles, Stephen D., 2016. "Dynamic pricing in discrete time stochastic day-to-day route choice models," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 104-118.
    12. Tan, Heqing & Xu, Xiangdong & Chen, Anthony, 2024. "On endogenously distinguishing inactive paths in stochastic user equilibrium: A convex programming approach with a truncated path choice model," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    13. Xu, Zhandong & Chen, Anthony & Li, Guoyuan & Li, Zhengyang & Liu, Xiaobo, 2024. "Elastic-demand bi-criteria traffic assignment under the continuously distributed value of time: A two-stage gradient projection algorithm with graphical interpretations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Wang, Ting & Li, Yao & Jia, Bin & Long, Jiancheng, 2024. "An autonomous vehicle exclusive lane design problem under the mixed autonomy traffic environment: Model formulation and large-scale algorithm design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    20. 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.

    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:189:y:2024:i:c:s1366554524002783. 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.