317
Views
2
CrossRef citations to date
0
Altmetric
Research Article

Convergence behavior for traffic assignment characterization metrics

, &
Pages 1244-1271 | Received 22 Mar 2020, Accepted 11 Nov 2020, Published online: 29 Dec 2020

References

  • Astroza, Sebastian, Priyadarshan N. Patil, Katherine I. Smith, and Chandra R. Bhat. 2017. “Transportation Planning to Accommodate Needs of Wind Energy Projects.” Transportation Research Record: Journal of the Transportation Research Board 2669 (1): 10–18.
  • Babazadeh, Abbas, Babak Javani, Guido Gentile, and Michael Florian. 2020. “Reduced Gradient Algorithm for User Equilibrium Traffic Assignment Problem.” Transportmetrica A: Transport Science 16 (3): 1111–1135.
  • Bar-Gera, Hillel. 2002. “Origin-based Algorithm for the Traffic Assignment Problem.” Transportation Science 36 (4): 398–417.
  • Bar-Gera, Hillel. 2006. “Primal Method for Determining the Most Likely Route Flows in Large Road Networks.” Transportation Science 40 (3): 269–286.
  • Bar-Gera, Hillel. 2010. “Traffic Assignment by Paired Alternative Segments.” Transportation Research Part B: Methodological 44 (8–9): 1022–1046.
  • Bar-Gera, Hillel, and Amos Luzon. 2007. “Differences Among Route Flow Solutions for the User-equilibrium Traffic Assignment Problem.” Journal of Transportation Engineering 133 (4): 232–239.
  • Beckmann, Martin, Charles B. McGuire, and Christopher B. Winsten. 1956. Studies in the Economics of Transportation. Technical Report RM-1488-PR. RAND Corporation.
  • Bliemer, Michiel C. J., and Mark P. H. Raadsen. 2020. “Static Traffic Assignment with Residual Queues and Spillback.” Transportation Research Part B: Methodological 132: 303–319.
  • Bliemer, Michiel C. J., Mark P. H. Raadsen, Luuk J. N. Brederode, Michael G. H. Bell, Luc J. J. Wismans, and Mike J. Smith. 2017. “Genetics of Traffic Assignment Models for Strategic Transport Planning.” Transport Reviews 37 (1): 56–78.
  • Boyce, David, Biljana Ralevic-Dekic, and Hillel Bar-Gera. 2004. “Convergence of Traffic Assignments: How Much is Enough?” Journal of Transportation Engineering 130 (1): 49–55.
  • Boyles, Stephen D. 2012. “Bush-based Sensitivity Analysis for Approximating Subnetwork Diversion.” Transportation Research Part B: Methodological 46 (1): 139–155.
  • Boyles, Stephen D. 2019. “tap-b Implementation.” Accessed May 25, 2019. https://github.com/spartalab/tap-b
  • Boyles, Stephen D., Nicholas E. Lownes, and A. Unnikrishnan. 2020. Transportation Network Analysis. Vol. 1.
  • Boyles, Stephen, Priyadarshan Patil, Venktesh Pandey, and Cesar Yahia. 2018. Beyond Political Boundaries: Constructing Network Models for Megaregion Planning. Technical Report CM2-11. The consortium of Cooperative Mobility for Competitive Megaregions (CM2).
  • Boyles, Stephen D., and Natalia Ruiz Juri. 2019. “Queue Spillback and Demand Uncertainty in Dynamic Network Loading.” Transportation Research Record: Journal of the Transportation Research Board2673 (2): 38–48.
  • Bureau of Public Roads. 1964. Traffic Assignment Manual for Application with a Large, High Speed Computer. Vol. 37. US Department of Commerce, Bureau of Public Roads, Office of Planning.
  • Bureau of Transportation Statistics. 2015. “Travel Time Index.” Accessed June 25, 2019. https://www.bts.gov/content/travel-time-index
  • California Department of Transportation. 2015. “CalTrans Strategic Management Plan 2015–2020.” Accessed May 25, 2019. https://www.dot.ca.gov/perf/library/pdf/Caltrans_Strategic_Mgmt_Plan_033015.pdf
  • Caliper Corporation. 2018. TransCAD Version 8 User Guide. Newton, MA: Caliper Corporation.
  • Cherlow, Jay R. 1981. “Measuring Values of Travel Time Savings.” Journal of Consumer Research 7 (4): 360–371.
  • Daneva, Maria, and Per Olov Lindberg. 2003. “A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment Problem.” In Operations Research Proceedings 2002, 133–138. Springer.
  • Daniels, Ginger, David R. Ellis, and Win R. Stockton. 1999. Techniques for Manually Estimating Road User Costs Associated with Construction Projects. Vol. 3. College Station, TX: Texas Transportation Institute.
  • Dial, Robert 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.
  • Duthie, Jennifer C., Avinash Unnikrishnan, and S. Travis Waller. 2011. “Influence of Demand Uncertainty and Correlations on Traffic Predictions and Decisions.” Computer-Aided Civil and Infrastructure Engineering 26 (1): 16–29.
  • Florian, Michael, Isabelle Constantin, and Dan 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.
  • Frank, Marguerite, and Philip Wolfe. 1956. “An Algorithm for Quadratic Programming.” Naval Research Logistics Quarterly 3 (1–2): 95–110.
  • Galligari, Alessandro, and Marco Sciandrone. 2019. “A Computational Study of Path-based Methods for Optimal Traffic Assignment with Both Inelastic and Elastic Demand.” Computers & Operations Research 103: 158–166.
  • Gentile, Guido. 2014. “Local User Cost Equilibrium: A Bush-based Algorithm for Traffic Assignment.” Transportmetrica A: Transport Science 10 (1): 15–54.
  • Harrison, R., M. Schofield, L. Loftus-Otway, D. Middleton, and J. West. 2006. Freight Performance Measures Guide. Project Progress Report no. 0-5410-P3. Texas Department of Transportation.
  • Higgins, S. F. 2013. “Estimating Economic Impacts from Transportation Investments Using the Texas Statewide Analysis Model and TREDIS.” BS thesis, The University of Texas at Austin, Austin, TX.
  • Holguín-Veras, José, Coral A. Torres Cruz, and Xuegang Ban. 2013. “On the Comparative Performance of Urban Delivery Vehicle Classes.” Transportmetrica A: Transport Science 9 (1): 50–73.
  • Jafari, Ehsan, Venktesh Pandey, and Stephen D. Boyles. 2017. “A Decomposition Approach to the Static Traffic Assignment Problem.” Transportation Research Part B: Methodological 105: 270–296.
  • Jayakrishnan, R., Wei T. Tsai, Joseph N. Prashker, and Subodh Rajadhyaksha. 1994. A Faster Path-Based Algorithm for Traffic Assignment. Technical Report. University of California Transportation Center.
  • Josefsson, Magnus, and Michael Patriksson. 2007. “Sensitivity Analysis of Separable Traffic Equilibrium Equilibria with Application to Bilevel Optimization in Network Design.” Transportation Research Part B: Methodological 41 (1): 4–31.
  • Lessan, Javad, and Liping Fu. 2019. “Credit-and Permit-based Travel Demand Management State-of-the-Art Methodological Advances.” Transportmetrica A: Transport Science 1–24. https://doi.org/https://doi.org/10.1080/23249935.2019.1692963.
  • Litman, Todd. 2016. Well Measured. Victoria, Boritish Columbia: Victoria Transport Policy Institute.
  • Lundgren, Jan T., and Anders Peterson. 2008. “A Heuristic for the Bilevel Origin–Destination-matrix Estimation Problem.” Transportation Research Part B: Methodological 42 (4): 339–354.
  • Maryland Department of Transportation. 2018. “Maryland Department of Transportation Strategic Plan.” Accessed May 25, 2019. https://www.roads.maryland.gov/OPPEN/2018_MDOT_TSMO_Strategic_Plan.pdf
  • Mitradjieva, Maria, and Per Olov Lindberg. 2013. “The Stiff is Moving – Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment.” Transportation Science 47 (2): 280–293.
  • Moudon, Anne Vernez, and Orion Stewart. 2013. “Tools for Estimating VMT Reductions from Built Environment Changes.” Washington State Department of Transportation, Olympia, Washington.
  • Nie, Yu Marco. 2010. “A Class of Bush-based Algorithms for the Traffic Assignment Problem.” Transportation Research Part B: Methodological 44 (1): 73–89.
  • North Carolina Department of Transportation. 2015. “North Carolina Department of Transportation Strategic Plan F.Y. 2018–2022.” Accessed May 25, 2019. https://www.ncdot.gov/about-us/our-mission/Performance/Documents/StrategicPlan_2015_2017.pdf
  • Patriksson, Michael. 1994. The Traffic Assignment Problem: Models and Methods. Mineola, New York: VSP.
  • Perederieieva, Olga, Matthias Ehrgott, Andrea Raith, and Judith Y. T. Wang. 2015. “A Framework for and Empirical Study of Algorithms for Traffic Assignment.” Computers & Operations Research 54: 90–107.
  • Qian, Z., and M. H. Zhang. 2012. “Full Closure Or Partial Closure? Evaluation of Construction Plans for the I-5 Closure in Downtown Sacramento.” Journal of Transportation Engineering 139 (3): 273–286.
  • Remi-Omosowon, Ayodeji. 2020. “Pyeasyga Repository.” Accessed May 25, 2020. https://github.com/remiomosowon/pyeasyga
  • Rose, Geoffrey, Mark S. Daskin, and Frank S. Koppelman. 1988. “An Examination of Convergence Error in Equilibrium Traffic Assignment Models.” Transportation Research Part B: Methodological 22 (4): 261–274.
  • Rossi, Thomas F., Sue McNeil, and Chris Hendrickson. 1989. “Entropy Model for Consistent Impact-Fee Assessment.” Journal of Urban Planning and Development 115 (2): 51–63.
  • Schneck, Arne, and Klaus Nökel. 2020. “Accelerating Traffic Assignment with Customizable Contraction Hierarchies.” Transportation Research Record: Journal of the Transportation Research Board 2674 (2): 0361198119898455.
  • Seattle Department of Transportation. 2016. “Seattle Department of Transportation Strategic Plan F.Y. 2018–2022.” Accessed May 25, 2019. https://www.seattle.gov/Documents/Departments/SDOT/TechnologyProgram/ITSStrategicPlan20102020.pdf
  • Shayanfar, Elham, and Paul Schonfeld. 2019. “Selecting and Scheduling Interrelated Road Projects with Uncertain Demand.” Transportmetrica A: Transport Science 15 (2): 1712–1733.
  • Stabler, Ben. 2019. “Transportation Networks.” Accessed May 25, 2019. https://github.com/bstabler/TransportationNetworks
  • Ukkusuri, Satish V., Tom V. Mathew, and S. Travis Waller. 2007. “Robust Transportation Network Design Under Demand Uncertainty.” Computer-Aided Civil and Infrastructure Engineering 22 (1): 6–18.
  • US Department of Transportation. 2016. “US Department of Transportation Value of Time Memorandum.” Accessed May 25, 2019. https://www.transportation.gov/sites/dot.gov/files/docs/Value%20of%20Travel%20Time%20Memorandum.pdf
  • US Department of Transportation. 2017. “US Department of Transportation Strategic Plan F.Y. 2018–2022.” Accessed May 25, 2019. https://www.transportation.gov/sites/dot.gov/files/docs/mission/administrations/office-policy/304866/dot-strategic-planfy2018-2022508.pdf
  • Waller, S. Travis, Joseph L. Schofer, and Athanasios K. Ziliaskopoulos. 2001. “Evaluation with Traffic Assignment Under Demand Uncertainty.” Transportation Research Record: Journal of the Transportation Research Board 1771 (1): 69–74.
  • Weisbrod, Glen. 2008. “Models to Predict the Economic Development Impact of Transportation Projects: Historical Experience and New Applications.” The Annals of Regional Science 42 (3): 519–543.
  • Xie, Jun, and Chi 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 (1): 46–55.
  • Yang, Hai. 1995. “Heuristic Algorithms for the Bilevel Origin-destination Matrix Estimation Problem.” Transportation Research Part B: Methodological 29 (4): 231–242.
  • Yang, Hai. 1997. “Sensitivity Analysis for the Elastic-demand Network Equilibrium Problem with Applications.” Transportation Research Part B: Methodological 31 (1): 55–70.
  • Yang, Hai, and Michael G. H. Bell. 1998. “Models and Algorithms for Road Network Design: A Review and Some New Developments.” Transport Reviews 18 (3): 257–278.
  • Yang, Hai, and William H. K. Lam. 1996. “Optimal Road Tolls Under Conditions of Queueing and Congestion.” Transportation Research Part A: Policy and Practice 30 (5): 319–332.
  • Yin, Yafeng. 2000. “Genetic-Algorithms-Based Approach for Bilevel Programming Models.” Journal of Transportation Engineering 126 (2): 115–120.
  • Zhao, Yong, and Kara Maria Kockelman. 2002. “The Propagation of Uncertainty Through Travel Demand Models: An Exploratory Analysis.” The Annals of Regional Science 36 (1): 145–163.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.