Origin-destination-based truncated quadratic programming algorithm for traffic assignment problem

References

• Aashtiani, H. Z. 1976. “The Multi-Modal Traffic Assignment Problem.” PhD diss., MIT.
   Google Scholar
• Bar-Gera, H. 2002. “Origin-Based Algorithm for the Traffic Assignment Problem.” Transportation Science 36 (4): 398–417.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–9): 1022–1046.10.1016/j.trb.2009.11.004
   Web of Science ®Google Scholar
• Bar-Gera, H. 2015. Transportation Test Problems. [Online] Bgu.ac.il. Accessed June 19, 2015. http://www.bgu.ac.il/~bargera/tntp
   Google Scholar
• Bar-Gera, H., F. Hellman, and M. Patriksson. 2013. “Computational Precision of Traffic Equilibria Sensitivities in Automatic Network Design and Road Pricing.” Transportation Research Part B: Methodological 57: 485–500.10.1016/j.trb.2013.08.018
   Web of Science ®Google Scholar
• Beckmann, M., C. McGuire, and C. Winsten. 1956. Studies in the Economics of Transportation. New Haven, CT: Published for the Cowles Commission for Research in Economics by Yale University Press.
   Google Scholar
• Bertsekas, D. 1976. “On the Goldstein–Levitin–Polyak Gradient Projection Method.” IEEE Transactions on Automatic Control 21 (2): 174–184.10.1109/TAC.1976.1101194
   Web of Science ®Google Scholar
• Chen, A., R. Jayakrishnan, and W. Tsai. 2002. “Faster Frank–Wolfe Traffic Assignment with New Flow Update Scheme.” Journal of Transportation Engineering 128 (1): 31–39.10.1061/(ASCE)0733-947X(2002)128:1(31)
   Web of Science ®Google Scholar
• Dembo, R. S. 1982. “Large Scale Nonlinear Optimization.” In Nonlinear Optimization, edited by M. J. D. Powell, 361–372. London: Academic Press.
   Google Scholar
• Dembo, R. S., and U. Tulowitzki. 1984. “Sequential Truncated Quadratic Programming.” In Numerical Optimization Proceedings, Society of Industrial and Applied Mathematics, Philadelphia, PA.
   Google Scholar
• Dembo, R., and U. Tulowitzki. 1988. “Computing Equilibria on Large Multicommodity Networks: An Application of Truncated Quadratic Programming Algorithms.” Networks 18 (4): 273–284.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Dial, R. 2006. “A Path-Based User-equilibrium Traffic Assignment Algorithm That Obviates Path Storage and Enumeration.” Transportation Research Part B: Methodological 40 (10): 917–936.10.1016/j.trb.2006.02.008
   Web of Science ®Google Scholar
• Di Lorenzo, D., A. Galligari, and M. Sciandrone. 2015. “A Convergent and Efficient Decomposition Method for the Traffic Assignment Problem.” Computational Optimization and Applications 60 (1): 151–170.10.1007/s10589-014-9668-6
   Web of Science ®Google Scholar
• EMME release 4.2.3. 2015. INRO Consultants Inc. Montreal.
   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: 10–16.10.3141/2090-02
   Web of Science ®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 17 (3): 319–339.10.1002/(ISSN)1097-0037
   Web of Science ®Google Scholar
• Frank, M., and P. Wolfe. 1956. “An Algorithm for Quadratic Programming.” Naval Research Logistics 3 (1–2): 95–110.10.1002/(ISSN)1931-9193
   Google Scholar
• Fukushima, M. 1984. “A Modified Frank–Wolfe Algorithm for Solving the Traffic Assignment Problem.” Transportation Research Part B: Methodological 18 (2): 169–177.10.1016/0191-2615(84)90029-8
   Web of Science ®Google Scholar
• Gentile, G. 2012. “Local User Cost Equilibrium: A Bush-Based Algorithm for Traffic Assignment.” Transportmetrica A: Transport Science 10 (1): 15–54.
   Web of Science ®Google Scholar
• Griva, I., S. Nash, and A. Sofer. 2009. Linear and Nonlinear Optimization. Philadelphia, PA: Society for Industrial and Applied Mathematics.10.1137/1.9780898717730
   Google Scholar
• Hearn, D., S. Lawphongpanich, and J. Ventura. 1985. “Finiteness in Restricted Simplicial Decomposition.” Operations Research Letters 4 (3): 125–130.10.1016/0167-6377(85)90016-1
   Web of Science ®Google Scholar
• Holmgren, J., and P. Lindberg. 2014. “Upright Stiff: Subproblem Updating in the FW Method for Traffic Assignment.” EURO Journal on Transportation and Logistics 3 (3–4): 205–225.10.1007/s13676-013-0031-3
   Google Scholar
• Inoue, S., and T. Maruyama. 2012. “Computational Experience on Advanced Algorithms for User Equilibrium Traffic Assignment Problem and Its Convergence Error.” Procedia – Social and Behavioral Sciences 43: 445–456.10.1016/j.sbspro.2012.04.118
   Google Scholar
• Jayakrishnan, R., W. K. Tsai, J. Prasker, 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
• Kumar, A., and S. Peeta. 2010. “Slope-Based Multipath Flow Update Algorithm for Static User Equilibrium Traffic Assignment Problem.” Transportation Research Record: Journal of the Transportation Research Board 2196: 1–10.10.3141/2196-01
   Web of Science ®Google Scholar
• Kumar, A., and S. Peeta. 2014. “Slope-based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem.” International Journal for Traffic and Transport Engineering 4 (3): 297–319.10.7708/2217-544X
   Google Scholar
• Larsson, T., and M. Patriksson. 1992. “Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem.” Transportation Science 26 (1): 4–17.10.1287/trsc.26.1.4
   Web of Science ®Google Scholar
• LeBlanc, L., E. Morlok, and W. Pierskalla. 1975. “An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem.” Transportation Research 9 (5): 309–318.10.1016/0041-1647(75)90030-1
   Google Scholar
• Lee, D., and Y. Nie. 2001. “Accelerating Strategies and Computational Studies of the Frank–Wolfe Algorithm for the Traffic Assignment Problem.” Transportation Research Record: Journal of the Transportation Research Board 1771: 97–105.10.3141/1771-13
   Google Scholar
• Lee, D., Y. Nie, and A. Chen. 2003. “A Conjugate Gradient Projection Algorithm for the Traffic Assignment Problem.” Mathematical and Computer Modelling 37 (7–8): 863–878.10.1016/S0895-7177(03)00090-6
   Google Scholar
• Mitradjieva, M., and P. Lindberg. 2013. “The Stiff is Moving-Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment.” Transportation Science 47 (2): 280–293.10.1287/trsc.1120.0409
   Web of Science ®Google Scholar
• Nie, Y. 2010. “A Class of Bush-based Algorithms for the Traffic Assignment Problem.” Transportation Research Part B: Methodological 44 (1): 73–89.10.1016/j.trb.2009.06.005
   Web of Science ®Google Scholar
• Open Channel Foundation. 2014. Accessed October, 2014. http://www.openchannelfoundation.org
   Google Scholar
• Palomares, U., and O. Mangasarian. 1976. “Superlinearly Convergent Quasi–Newton Algorithms for Nonlinearly Constrained Optimization Problems.” Mathematical Programming 11 (1): 1–13.10.1007/BF01580366
   Web of Science ®Google Scholar
• Patriksson, M. 1994. The Traffic Assignment Problem. Utrecht: VSP.
   Google Scholar
• Perederieieva, O., M. Ehrgott, A. Raith, and J. Wang. 2015. “A Framework for and Empirical Study of Algorithms for Traffic Assignment.” Computers & Operations Research 54: 90–107.10.1016/j.cor.2014.08.024
   Web of Science ®Google Scholar
• Rosen, J. 1960. “The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints.” Journal of the Society for Industrial and Applied Mathematics 8 (1): 181–217.10.1137/0108011
   Google Scholar
• Sheffi, Y. 1985. Urban Transportation Networks. Englewood Cliffs, NJ: Prentice-Hall.
   Google Scholar
• Wardrop, J. 1952. “Road Paper. Some Theoretical Aspects of Road Traffic Research.” ICE Proceedings: Engineering Divisions 1 (3): 325–362.
   Google Scholar
• Wolfe, P. 1967. “Methods of Nonlinear Programming.” In Chap. 6 of Nonlinear Programming, edited by J. Abadie, 97–131. New York: Interscience/John Wiley.
   Google Scholar
• Xie, J., and C. Xie. 2015. “Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance.” Transportation Research Record: Journal of the Transportation Research Board 2498: 46–55.10.3141/2498-06
   Web of Science ®Google Scholar
• Zheng, H. 2015. “Adaptation of Network Simplex for the Traffic Assignment Problem.” Transportation Science 49 (3): 543–558.10.1287/trsc.2014.0574
   Web of Science ®Google Scholar