A parallel computing framework for solving user equilibrium problem on computer clusters

References

• Bar-Gera, H. 2002. “Origin-based Algorithm for the Traffic Assignment Problem.” Transportation Science 36 (4): 398–417. doi: 10.1287/trsc.36.4.398.549
   Web of Science ®Google Scholar
• Bar-Gera, H. 2010. “Traffic Assignment by Paired Alternative Segments.” Transportation Research Part B: Methodological 44 (8): 1022–1046. doi: 10.1016/j.trb.2009.11.004
   Web of Science ®Google Scholar
• Barney, B. 2019. Introduction to Parallel Computing. Livermore, CA: Lawrence Livermore National Laboratory.
   Google Scholar
• Beckmann, M., C. B. McGuire, and C. B. Winsten. 1956. Studies in the Economics of Transportation. Connecticut: Yale University Press.
   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.” Institute of Transportation Studies, University of California, Irvine.
   Google Scholar
• Chen, A., R. Jayakrishnan, and W. K. Tsai. 2002a. “Faster Frank-Wolfe Traffic Assignment with New Flow Update Scheme.” Journal of Transportation Engineering 128 (1): 31–39. doi: 10.1061/(ASCE)0733-947X(2002)128:1(31)
   Google Scholar
• Chen, A., D. H. Lee, and R. Jayakrishnan. 2002b. “Computational Study of State-of-the-art Path-based Traffic Assignment Algorithms.” Mathematics and Computers in Simulation 59 (6): 509–518. doi: 10.1016/S0378-4754(01)00437-2
   Web of Science ®Google Scholar
• Chen, R.-J., and R. R. Meyer. 1988. “Parallel Optimization for Traffic Assignment.” Mathematical Programming 42 (1): 327–345. doi: 10.1007/BF01589409
   Web of Science ®Google Scholar
• Dean, J., and S. Ghemawat. 2008. “MapReduce: Simplified Data Processing on Large Clusters.” Communications of the ACM 51 (1): 107–113. doi: 10.1145/1327452.1327492
   Web of Science ®Google Scholar
• Dean, J., and S. Ghemawat. 2010. “MapReduce: A Flexible Data Processing Tool.” Communications of the ACM 53 (1): 72–77. doi: 10.1145/1629175.1629198
   Web of Science ®Google Scholar
• Dial, R. B. 2006. “A Path-based User-Equilibrium Traffic Assignment Algorithm That Obviates Path Storage and Enumeration.” Transportation Research Part B: Methodological 40 (10): 917–936. doi: 10.1016/j.trb.2006.02.008
   Web of Science ®Google Scholar
• Evans, S. P. 1976. “Derivation and Analysis of Some Models for Combining Trip Distribution and Assignment.” Transportation Research 10 (1): 37–57. doi: 10.1016/0041-1647(76)90100-3
   Google Scholar
• Feijoo, B., and R. Meyer. 1988. “Piecewise-linear Approximation Methods for Nonseparable Convex Optimization.” Management Science 34 (3): 411–419. doi: 10.1287/mnsc.34.3.411
   Web of Science ®Google Scholar
• Florian, M., and M. Gendreau. 2001. “Applications of Parallel Computing in Transportation.” Parallel Computing 27 (12): 1521–1522. doi: 10.1016/S0167-8191(01)00102-8
   Web of Science ®Google Scholar
• Frank, M., and P. Wolfe. 1956. “An Algorithm for Quadratic Programming.” Naval Research Logistics Quarterly 3 (1–2): 95–110. doi: 10.1002/nav.3800030109
   Google Scholar
• Gentile, G. 2014. “Local User Cost Equilibrium: A Bush-based Algorithm for Traffic Assignment.” Transportmetrica A: Transport Science 10 (1): 15–54. doi: 10.1080/18128602.2012.691911
   Web of Science ®Google Scholar
• Gropp, W. D., W. Gropp, E. Lusk, A. Skjellum, and A. D. F. E. E. Lusk. 1999. Using MPI: Portable Parallel Programming with the Message-Passing Interface. Cambridge: MIT Press.
   Google Scholar
• Habbal, M. B., H. N. Koutsopoulos, and S. R. Lerman. 1994. “A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures.” Transportation Science 28 (4): 292–308. doi: 10.1287/trsc.28.4.292
   Web of Science ®Google Scholar
• Huang, H.-J., and W. H. K. Lam. 2002. “Modeling and Solving the Dynamic User Equilibrium Route and Departure Time Choice Problem in Network with Queues.” Transportation Research Part B: Methodological 36 (3): 253–273. doi: 10.1016/S0191-2615(00)00049-7
   Web of Science ®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. doi: 10.1016/j.trb.2017.09.011
   Web of Science ®Google Scholar
• Jayakrishnan, R., T. T. Wei, J. N. Prashker, and S. Rajadhyaksha. 1994. “A Faster Path-based Algorithm for Traffic Assignment.” Transportation Research Record: Journal of the Transportation Research Board 1443: 75–83.
   Google Scholar
• Josyula, S. P., J. Törnquist Krasemann, and L. Lundberg. 2018. “A Parallel Algorithm for Train Rescheduling.” Transportation Research Part C: Emerging Technologies 95: 545–569. doi: 10.1016/j.trc.2018.07.003
   Web of Science ®Google Scholar
• Kish, L. B. 2002. “End of Moore’s Law: Thermal (Noise) Death of Integration in Micro and Nano Electronics.” Physics Letters A 305 (3–4): 144–149. doi: 10.1016/S0375-9601(02)01365-8
   Web of Science ®Google Scholar
• Kumar, V., and V. Singh. 1991. “Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem.” Journal of Parallel and Distributed Computing 13 (2): 124–138. doi: 10.1016/0743-7315(91)90083-L
   Web of Science ®Google Scholar
• Larsson, T., A. Migdalas, and M. Partriksson. 1993. “A Partial Linearization Method for the Traffic Assignment Problem.” Optimization 28 (1): 47–61. doi: 10.1080/02331939308843903
   Google Scholar
• LeBlanc, L. J., E. K. Morlok, and W. P. Pierskalla. 1975. “An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem.” Transportation Research 9 (5): 309–318. doi: 10.1016/0041-1647(75)90030-1
   Google Scholar
• Liu, Z., X. Chen, Q. Meng, and I. Kim. 2018. “Remote Park-and-Ride Network Equilibrium Model and Its Applications.” Transportation Research Part B: Methodological 117: 37–62. doi: 10.1016/j.trb.2018.08.004
   Web of Science ®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.
   Web of Science ®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 (2): 83–98. doi: 10.1016/j.trc.2013.02.012
   Web of Science ®Google Scholar
• Ma, J., B. L. Smith, and X. Zhou. 2016. “Personalized Real-Time Traffic Information Provision: Agent-based Optimization Model and Solution Framework.” Transportation Research Part C: Emerging Technologies 64: 164–182. doi: 10.1016/j.trc.2015.03.004
   Web of Science ®Google Scholar
• Meng, Q., and Z. Liu. 2012a. “Impact Analysis of Cordon-based Congestion Pricing on Mode-Split for a Bimodal Transportation Network.” Transportation Research Part C: Emerging Technologies 21 (1): 134–147. doi: 10.1016/j.trc.2011.06.007
   Web of Science ®Google Scholar
• Meng, Q., and Z. Liu. 2012b. “Mathematical Models and Computational Algorithms for Probit-based Asymmetric Stochastic User Equilibrium Problem with Elastic Demand.” Transportmetrica 8 (4): 261–290. doi: 10.1080/18128601003736026
   Web of Science ®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. doi: 10.1016/j.tre.2012.04.004
   Web of Science ®Google Scholar
• Meng, Q., Z. Liu, and S. Wang. 2014. “Asymmetric Stochastic User Equilibrium Problem with Elastic Demand and Link Capacity Constraints.” Transportmetrica A: Transport Science 10 (4): 304–326. doi: 10.1080/23249935.2013.765929
   Web of Science ®Google Scholar
• Ni, E. C., D. F. Ciocan, S. G. Henderson, and S. R. Hunter. 2017. “Efficient Ranking and Selection in Parallel Computing Environments.” Operations Research 65 (3): 821–836. doi: 10.1287/opre.2016.1577
   Web of Science ®Google Scholar
• Nie, Y. M. 2010. “A Class of Bush-based Algorithms for the Traffic Assignment Problem.” Transportation Research Part B: Methodological 44 (1): 73–89. doi: 10.1016/j.trb.2009.06.005
   Web of Science ®Google Scholar
• O'Cearbhaill, E. A., and M. O'Mahony. 2005. “Parallel Implementation of a Transportation Network Model.” Journal of Parallel and Distributed Computing 65 (1): 1–14. doi: 10.1016/j.jpdc.2004.07.003
   Web of Science ®Google Scholar
• Pape, U. 1974. “Implementation and Efficiency of Moore-Algorithms for the Shortest Route Problem.” Mathematical Programming 7 (1): 212–222. doi: 10.1007/BF01585517
   Google Scholar
• Patriksson, M. 1994. The Traffic Assignment Problem: Models and Methods. New York: Courier Dover.
   Google Scholar
• Perederieieva, O., M. Ehrgott, A. Raith, and J. Y. Wang. 2015. “A Framework For and Empirical Study of Algorithms for Traffic Assignment.” Computers & Operations Research 54: 90–107. doi: 10.1016/j.cor.2014.08.024
   Web of Science ®Google Scholar
• Qu, Y., and X. Zhou. 2017. “Large-scale Dynamic Transportation Network Simulation: A Space-Time-Event Parallel Computing Approach.” Transportation Research Part C: Emerging Technologies 75: 1–16. doi: 10.1016/j.trc.2016.12.003
   Web of Science ®Google Scholar
• Ran, B., and D. Boyce. 2012. Dynamic Urban Transportation Network Models: Theory and Implications for Intelligent Vehicle-Highway Systems. Heidelberg, Germany: Springer Science & Business Media.
   Google Scholar
• Sheffi, Y. 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Englewood Cliffs: Prentice Hall.
   Google Scholar
• Song, Z., Y. He, and L. Zhang. 2017. “Integrated Planning of Park-and-Ride Facilities and Transit Service.” Transportation Research Part C: Emerging Technologies 74: 182–195. doi: 10.1016/j.trc.2016.11.017
   Web of Science ®Google Scholar
• Träff, J. L. 1995. “An Experimental Comparison of Two Distributed Single-Source Shortest Path Algorithms.” Parallel Computing 21 (9): 1505–1532. doi: 10.1016/0167-8191(95)00025-J
   Web of Science ®Google Scholar
• Wardrop, J. G. 1952. “ Some Theoretical Aspects of Road Traffic Research.” Proc. Inst. of Civil Engineers, Part 2, pp. 325–378.
   Google Scholar
• White, T. 2012. Hadoop: The Definitive Guide. Sebastopol: O'Reilly Media.
   Google Scholar
• Wong, S. C. 1997. “Group-based Optimisation of Signal Timings Using Parallel Computing.” Transportation Research Part C: Emerging Technologies 5 (2): 123–139. doi: 10.1016/S0968-090X(97)00006-5
   Web of Science ®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. doi: 10.1177/0361198118774236
   Web of Science ®Google Scholar
• Xie, J., and C. Xie. 2015. “Origin-based Algorithms for Traffic Assignment.” Transportation Research Record: Journal of the Transportation Research Board 2498: 46–55. doi: 10.3141/2498-06
   Web of Science ®Google Scholar
• Xiong, C., X. Zhou, and L. Zhang. 2018. “AgBM-DTALite: An Integrated Modelling System of Agent-based Travel Behaviour and Transportation Network Dynamics.” Travel Behaviour and Society 12: 141–150. doi: 10.1016/j.tbs.2017.04.004
   Web of Science ®Google Scholar
• Yang, H., and H. Huang. 2005. Mathematical and Economic Theory of Road Pricing. Oxford: Elsevier.
   Google Scholar
• Zaharia, M., M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. 2012. “ Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing,” Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation. USENIX Association, pp. 2–2.
   Google Scholar
• Zaharia, M., M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. 2010. “Spark: Cluster Computing with Working Sets.” HotCloud 10 (10–10): 95.
   Google Scholar
• Zaharia, M., R. S. Xin, P. Wendell, T. Das, M. Armbrust, A. Dave, X. Meng, J. Rosen, S. Venkataraman, and M. J. Franklin. 2016. “Apache Spark.” Communications of the ACM 59 (11): 56–65. doi: 10.1145/2934664
   Web of Science ®Google Scholar
• Zhang, L., H. Yang, D. Wu, and D. Wang. 2014. “Solving a Discrete Multimodal Transportation Network Design Problem.” Transportation Research Part C: Emerging Technologies 49: 73–86. doi: 10.1016/j.trc.2014.10.008
   Web of Science ®Google Scholar
• Zhao, C., and J. Wood. 1989. “The Monte Carlo Method on a Parallel Computer.” Annals of Nuclear Energy 16 (12): 649–657. doi: 10.1016/0306-4549(89)90142-4
   Web of Science ®Google Scholar