An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem

References

• Babazadeh, A., B. Javani, G. Gentile, and M. Florian. 2020. “Reduced Gradient Algorithm for User Equilibrium Traffic Assignment Problem.” Transportmetrica A: Transport Science 16 (3): 1111–1135.
   Google Scholar
• Bar-Gera, H. 2002. “Origin-based Algorithm for the Traffic Assignment Problem.” Transportation Science 36 (4): 398–417.
   Google Scholar
• Bar-Gera, H. 2010. “Traffic Assignment by Paired Alternative Segments.” Transportation Research Part B: Methodological 44 (8): 1022–1046.
   Google Scholar
• Bazaraa, M., and C. Shetty. 1979. Nonlinear Programming: Theory and Algorithms. New York, NY: John Wiley & Sons.
   Google Scholar
• Beck, A., and L. Tetruashvili. 2013. “On the Convergence of Block Coordinate Descent Type Methods.” SIAM Journal on Optimization 23 (4): 2037–2060.
   Google Scholar
• Beckmann, M., C. B. McGuire, and C. B. Winsten. 1956. “Studies in the Economics of Transportation.” The Economic Journal 67 (265): 116–118.
   Google Scholar
• Berteskas, D., and J. Tsitsiklis. 1989. Parallel and Distributed Computation – Numerical Methods. Englewood Cliffs, NJ: Prentice-Hall.
   Google Scholar
• Bonettini, S. 2011. “Inexact Block Coordinate Descent Methods with Application to Non-negative Matrix Factorization.” IMA Journal of Numerical Analysis 31 (4): 1431–1452.
   Google Scholar
• Chen, A., and R. Jayakrishnan. 1998. A Path-Based Gradient Projection Algorithm: Effects of Equilibration with a Restricted Path Set Under two Flow Update Policies. Irvine: University of California.
   Google Scholar
• Chen, X., Z. Liu, K. Zhang, and Z. Wang. 2020. “A Parallel Computing Approach to Solve Traffic Assignment Using Path-Based Gradient Projection Algorithm.” Transportation Research Part C: Emerging Technologies 120: 102809.
   Google Scholar
• Cheng, Q., S. Wang, Z. Liu, and Y. Yuan. 2019. “Surrogate-based Simulation Optimization Approach for day-to-day Dynamics Model Calibration with Real Data.” Transportation Research Part C: Emerging Technologies 105: 422–438.
   Google Scholar
• Dafermos, S. C., and F. T. Sparrow. 1969. “The Traffic Assignment Problem for a General Network.” Journal of Research of the National Bureau of Standards Section B: Mathematical Sciences 73 (2): 91–118.
   Google Scholar
• Feijoo, B., and R. Meyer. 1988. “Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization.” Management Science 34 (3): 411–419.
   Google Scholar
• Fercoq, O., and P. Richtarik. 2015. “Accelerated, Parallel, and Proximal Coordinate Descent.” SIAM Journal on Optimization 25 (4): 1997–2023.
   Google Scholar
• Florian, M., I. Constantin, and D. Florian. 2009. “A New Look at Projected Gradient Method for Equilibrium Assignment.” Transportation Research Record: Journal of the Transportation Research Board 2090 (1): 10–16.
   Google Scholar
• Florian, M., J. Guálat, and H. Spiess. 1987. “An Efficient Implementation of the Partan Variant of the Linear Approximation Method for the Network Equilibrium Problem.” Networks and Spatial Economics 17 (3): 319–339.
   Google Scholar
• Floyd, Robert W. 1962. “Algorithm 97, Shortest Path Algorithms.” Communications of the ACM 5 (6): 345.
   Google Scholar
• Frank, M., and P. Wolfe. 1956. “An Algorithm for Quadratic Programming.” Naval Research Logistics Quarterly 3 (1): 95–110.
   Google Scholar
• Galligari, A., and M. Sciandrone. 2018. “A Convergent and Fast Path Equilibration Algorithm for the Traffic Assignment Problem.” Optimization Methods and Software 33 (2): 354–371.
   Google Scholar
• Gentile, G. 2014. “Local User Cost Equilibrium: A Bush-Based Algorithm for Traffic Assignment.” Transportmetrica A: Transport Science 10 (1): 15–54.
   Google Scholar
• Grippo, L., and M. Sciandrone. 2000. “On the Convergence of the Block Nonlinear Gauss–Seidel Method Under Convex Constraints.” Operations Research Letters 26 (3): 127–136.
   Google Scholar
• Huang, D., X. Chen, Z. Liu, C. Lyu, S. Wang, and X. Chen. 2020a. “A Static Bike Repositioning Model in a hub-and-Spoke Network Framework.” Transportation Research Part E: Logistics and Transportation Review 141: 102031.
   Google Scholar
• Huang, D., Y. Gu, S. Wang, Z. Liu, and W. Zhang. 2020b. “A two-Phase Optimization Model for the Demand-Responsive Customized bus Network Design.” Transportation Research Part C: Emerging Technologies 111: 1–21.
   Google Scholar
• Jafari, E., V. Pandey, and S. D. Boyles. 2017. “A Decomposition Approach to the Static Traffic Assignment Problem.” Transportation Research Part B: Methodological 105: 270–296.
   Google Scholar
• Jayakrishnan, R., T. T. Wei, J. N. Prashker, and S. Rajadhyaksha. 1994. A Faster Path-Based Algorithm for Traffic Assignment. UC Berkeley: University of California Transportation Center.
   Google Scholar
• Larsson, T., A. Migdalas, and M. Partriksson. 1993. “A Partial Linearization Method for the Traffic Assignment Problem.” Optimization 28 (1): 47–61.
   Google Scholar
• Larsson, T., and M. Partriksson. 1992. “Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem.” Transportation Science 26 (1): 4–17.
   Google Scholar
• Lawphongpanich, S., and D. W. Hearn. 1984. “Simplical Decomposition of the Asymmetric Traffic Assignment Problem.” Transportation Research Part B: Methodological 18 (2): 123–133.
   Google Scholar
• Leventhal, D., and A. S. Lewis. 2010. “Randomized Methods for Linear Constraints: Convergence Rates and Conditioning.” Mathematics of Operations Research 35 (3): 641–654.
   Google Scholar
• Liu, Z., Y. Liu, C. Lyu, and J. Ye. 2020. “Building Personalized Transportation Model for Online Taxi-Hailing Demand Prediction.” IEEE Transactions on Cybernetics. doi:10.1109/TCYB.2020.3000929.
   Google Scholar
• Liu, Y., C. Lyu, Z. Liu, and J. Cao. 2021. “Exploring a Large-Scale Multi-Modal Transportation Recommendation System.” Transportation Research Part C: Emerging Technologies 126: 103070.
   Google Scholar
• Liu, Z., and Q. Meng. 2013. “Distributed Computing Approaches for Large-Scale Probit-Based Stochastic User Equilibrium Problems.” Journal of Advanced Transportation 47 (6): 553–571.
   Google Scholar
• Liu, Z., Q. Meng, and S. Wang. 2013. “Speed-based Toll Design for Cordon-Based Congestion Pricing Scheme.” Transportation Research Part C: Emerging Technologies 31: 83–98.
   Google Scholar
• Luo, Z. Q., and P. Tseng. 1992. “On the Convergence of the Coordinate Descent Method for Convex Differentiable Minimization.” Journal of Optimization Theory and Applications 72 (1): 7–35.
   Google Scholar
• Meng, Q., Z. Liu, and S. Wang. 2012. “Optimal Distance Tolls Under Congestion Pricing and Continuously Distributed Value of Time.” Transportation Research Part E: Logistics and Transportation Review 48 (5): 937–957.
   Google Scholar
• Mitradjieva, M., and P. O. Lindberg. 2013. “The Stiff is Moving–Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment.” Transportation Science 47 (2): 280–293.
   Google Scholar
• Nie, Y. 2012. “A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem.” Transportation Science 46 (1): 27–38.
   Google Scholar
• Patrascu, A., and I. Necoara. 2015. “Efficient Random Coordinate Descent Algorithms for Large-Scale Structured Nonconvex Optimization.” Journal of Global Optimization 61 (1): 19–46.
   Google Scholar
• Patriksson, M. 1994. The Traffic Assignment Problem: Models and Methods. New York (NY): Courier Dover Publications.
   Google Scholar
• Sheffi, Y. 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Englewood Cliffs (NJ): Prentice Hall.
   Google Scholar
• Shi, H.-J. M., S. Tu, Y. Xu, and W. Yin. 2017. “A Primer on Coordinate Descent Algorithms.” arXiv Preprint ArXiv:1610.00040v2. https://arxiv.org/abs/1610.00040v2.
   Google Scholar
• Tseng, P. 1990. “Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach.” SIAM Journal on Control and Optimization 28 (1): 214–242.
   Google Scholar
• Wang, J., S. Peeta, and X. He. 2019. “Multiclass Traffic Assignment Model for Mixed Traffic Flow of Human-Driven Vehicles and Connected and Autonomous Vehicles.” Transportation Research Part B: Methodological 126: 139–168.
   Google Scholar
• Wardrop, J. G. 1952. “Some Theoretical Aspects of Road Traffic Research.” Proceedings of the Institution of Civil Engineers 1 (3): 325–362.
   Google Scholar
• Xie, J., and Y. Nie. 2019. “A new Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment.” Transportation Science 53 (2): 566–584.
   Google Scholar
• Xie, J., Y. Nie, and X. Liu. 2018. “A Greedy Path-Based Algorithm for Traffic Assignment.” Transportation Research Record: Journal of the Transportation Research Board 2672 (48): 36–44.
   Google Scholar
• Xie, J., and C. Xie. 2014. “An Improved TAPAS Algorithm for the Traffic Assignment Problem.” 17th IEEE International Conference on Intelligent Transportation, Qingdao, China.
   Google Scholar
• Xie, J., and C. Xie. 2016. “New Insights and Improvements of Using Paired Alternative Segments for Traffic Assignment.” Transportation Research Part B: Methodological 93: 406–424.
   Google Scholar