Issues in Travel Demand Forecasting

Authors: Huey-Kuo Chen

Abstract:

Travel demand forecasting including four travel choices, i.e., trip generation, trip distribution, modal split and traffic assignment constructs the core of transportation planning. In its current application, travel demand forecasting has associated with three important issues, i.e., interface inconsistencies among four travel choices, inefficiency of commonly used solution algorithms, and undesirable multiple path solutions. In this paper, each of the three issues is extensively elaborated. An ideal unified framework for the combined model consisting of the four travel choices and variable demand functions is also suggested. Then, a few remarks are provided in the end of the paper

Keywords: Travel choices, B algorithm, entropy maximization, dynamic traffic assignment.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1093550

References:

[1] D.E. Boyce, M. Lupa, and Y. Zhang, "Introducing ‘feedback’ into four-step travel forecasting procedure vs. equilibrium solution of combined model,” Transportation Research Record, vol. 1443, 1994, pp. 65–74.
[2] H. Bar-Gera, and D.E. Boyce, "Solving the sequential procedure with feedback,” paper presented at the Sixth International Conference of Chinese Transportation Professionals, Dalian, China, 2006.
[3] S.P. Evans "Derivation and analysis of some models for combining trip distribution and assignment,” Transportation Research, vol. 10, 1976, pp. 37–57.
[4] M. Florian, S. Nguyen, and J. Ferland, "On the combined distribution-assignment of traffic,” Transportation Science, vol. 9, 1975, pp. 43–53.
[5] M. Abdulaal, and L. J. LeBlanc, "Methods for combining modal split and equilibrium assignment models,” Transportation Science, vol. 13, 1979, pp. 292–314.
[6] M. Florian, and S. Nguyen, "A combined trip distribution modal split and assignment model,” Transportation Research, vol. 12, 1978, pp. 241–246.
[7] H.K. Chen, 2013.07.27-28, "A combined model with the four travel choices and variable demand,” International Academic Conference on Social Sciences (IACSS 2013), Istanbul, Turkey.
[8] H.K. Chen, and K.C. Yen, "A algorithm for the combined model with the four travel choices and variable demand,” 2014. (In Chinese)
[9] M. Beckmann, C. B. McGuire, and C. B. Winsten, Studies in the Economics of Transportation, Yale University Press: New Haven, 1956.
[10] M. Frank, and P. Wolfe, "An algorithm for quadratic programming”, Naval Research Logistics Quarterly, vol. 3, 1956, pp. 95–110.
[11] R. Jayakrishnan, W.T. Tsai, J.N. Prashker, and S. Rajadhyaksha, "A Faster Path-Based Algorithm for Traffic Assignment,” University of California Transportation Center, Working Papers qt2hf4541x, University of California Transportation Center, 1994.
[12] T. Larsson, M. Patriksson, Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem, Transportation Science, vol. 26, no. 1, 1992, pp. 4-17.
[13] M. Patriksson, The Traffic Assignment Problem: Models and Methods, VSP: Utrecht, 1994.
[14] H. Bar-Gera, "Traffic assignment by paired alternative segments (TAPAS),” Transportation Research part B, vol. 44, 2010, pp. 1022–1046
[15] R.B. Dial, "A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration,” Transportation Research part B, vol. 40, 2006, pp. 917–936.
[16] G. Gentile, "Linear user cost equilibrium: a new algorithm for traffic assignment,” Submitted to Transportation Research Part B, 2009.
[17] H. Bar-Gera, "Origin-based algorithm for the traffic assignment problem,” Transportation Science, vol. 36, no. 4, 2002, pp. 398–417.
[18] M. Florian, I. Constantin, and D. Florian, "A new look at the projected gradient method,” In CD-ROM of TRB 2009 Annual Meeting, 2009.
[19] R.L. Tobin, and T. Friesz, "Sensitivity analysis for equilibrium network flow,” Transportation Science, vol. 22, no. 4, 1988, pp. 242–250.
[20] H. Bar-Gera, and D. Boyce, "Route flow entropy maximization in origin-based traffic assignment,” In: Ceder, A. (Ed.), Proceedings of the 14th International Symposium on Transportation and Traffic Theory, Jerusalem, Israel, Elsevier Science, Oxford, UK, 1999, pp. 397-415.
[21] J.G. Wardrop, "Some theoretical aspects of road traffic research,” In Proceedings of Institution of Civil Engineers, Part II, no. 1, 1952, pp. 325–378.
[22] H. Bar-Gera, "Primal method for determining the most likely route flows in large road networks,” Transportation Science, Vol. 40, No. 3, pp. 269-286, 2006.
[23] Y. Nie, "A class of bush-based algorithms for the traffic assignment problem,” Transportation Research part B, vol. 44, no. 1, 2010, pp. 73–89.
[24] Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall Inc: New Jersey, USA, 1985.
[25] H.K. Chen, "Supernetwork representations for combined travel choice models,” Open Transportation Journal, Vol. 5, 2011, pp. 92-104.