A Variable Time-Discretization Strategies-Based, Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment

REFERENCES

• Ban, X., Liu, H.X., Ferris, M.C., & Ran, B. (2008). A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations. Transportation Research Part B: Methodological, 42(9), 823–842. doi:10.1016/j.trb.2008.01.006
   Web of Science ®Google Scholar
• Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, XVI(1), 87–90.
   Google Scholar
• Ben-Akiva, M., Bierlaire, M., Koutsopoulos, H.N., & Mishalani, R. (1998). DynaMIT: A simulation-based system for traffic prediction and guidance generation. Paper presented at the 3rd Triennial Symposium on Transportation System, June, San Juan, Puerto Rico.
   Google Scholar
• Birge, J.R., & Ho, J.K. (1993). Optimal flows in stochastic dynamic networks with congestion. Operations Research, 41(1), 203–216.
   Web of Science ®Google Scholar
• Bliemer, M.C. J., & Bovy, P.H. L. (2003). Quasi-variational inequality formulation of the multiclass dynamic traffic assignment problem. Transportation Research Part B: Methodological, 37(6), 501–519. doi: http://dx.doi.org/10.1016/S0191-2615 (02)00025-5
   Web of Science ®Google Scholar
• Caliper. (2011). Traffic simulation models. Retrieved from http://www.caliper.com/TransModeler/Simulation.htm
   Google Scholar
• Carey, M. (1986). A constraint qualification for a dynamic traffic assignment model. Transportation Science, 20, 55–58.
   Web of Science ®Google Scholar
• Carey, M. (1987). Optimal time varying flows on congested networks. Operations Research, 35(1), 58–69.
   Web of Science ®Google Scholar
• Carey, M., & Ge, Y.E. (2004). Efficient discretization for link travel time models. Networks and Spatial Economics, 4, 269–290.
   Web of Science ®Google Scholar
• Carey, M., & Ge, Y.E. (2005). Convergence of a discretised travel-time model. Transportation Science, 39(1), 25–38.
   Web of Science ®Google Scholar
• Carey, M., & Subrahmanian, E. (2000). An approach to modeling time-varying flows on congested networks. Transportation Science, 34B(3), 157–183.
   Google Scholar
• Chabini, I. (1998). Discrete dynamic shortest path problem in transportation application. Transportation Research Record, 1645, 170–175.
   Google Scholar
• Chabini, I., & Lan, S. (2002). Adaptations of the A* Algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent Transporation System, 3(1), 60–74.
   Web of Science ®Google Scholar
• Chen, H.-K., & Hsueh, C.F. (1998). A model and an algorithm for the dynamic user-optimal route choice problem. Transportation Science, 32B(3), 219–234.
   Google Scholar
• Chiu, Y.-C., Bottom, J., Mahut, M., Paz, A., Waller, T., & Hicks, J. (2010). Dynamic Traffic Assignment: A Primer. Transportation Research Board. http://trid.trb.org/view.aspx?id=1112932
   Google Scholar
• Chiu, Y.-C., Nava, E., Zheng, H., & Bustillos, B. (2011). DynusT user's manual. Retrieved from http://dynust.net/wikibin/doku.php
   Google Scholar
• Chow, A.H. F. (2009). Properties of system optimal traffic assignment with departure time choice and its solution method. Transportation Research Part B, 43(3), 325–344.
   Google Scholar
• Cooke, K.L., & Halsey, E. (1966). The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications, 14(3), 493–498. doi:10.1016/0022-247x(66)90009-6
   Web of Science ®Google Scholar
• Dafermos, S. (1980). Traffic equilibrium and variational inequalities. Transportation Science, 14, 42–54.
   Web of Science ®Google Scholar
• Dean, B. (1999). Continuous-time dynamic shortest path algorithms. Master's thesis, MIT, Cambridge, MA.
   Google Scholar
• Dean, B. (2004). Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks, 44(1), 41–46. doi:10.1002/net.20013
   Web of Science ®Google Scholar
• Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.
   Web of Science ®Google Scholar
• Dreyfus, S.E. (1969). An appraisal of some shortest-path algorithms. Operations Research 17(3), 395–412.
   Web of Science ®Google Scholar
• Florian, M., Mahut, M., & Tremblay, N. (2008). Application of a simulation-based dynamic traffic assignment model. European Journal of Operational Research, 189(3), 1381–1392.
   Web of Science ®Google Scholar
• Friesz, T.L., Bernstein, D., Mehta, N.J., Tobin, R.L., & Ganjalizadeh, S. (1989). Dynamic network traffic assignment considered as a continuous time optimal control problem. Operations Research, 37(6), 893–901.
   Web of Science ®Google Scholar
• Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L., & Wie, B.W. (1993). A variational inequality formulation of the dynamic network user equilibrium problem. Operations Research, 41(1), 179–191.
   Web of Science ®Google Scholar
• Gallo, G., & Pallotino, S. (1988). Shortest Path algorithm. Annuals of Operation Research, 13, 3–79.
   Google Scholar
• Gao, Y. (2010). Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment system. Master of science thesis, Univeristy of Arizona, Tucson, AZ.
   Google Scholar
• Halpern, J. (1977). Shortest Route with time-dependent length of edges and limited delay possibilities in nodes. Zeitschrift fur Operations Research, 21, 117–124.
   Google Scholar
• Han, L., Ukkusuri, S., & Doan, K. (2011). Complementarity formulations for the cell transmission model based dynamic user equilibrium with departure time choice, elastic demand and user heterogeneity. Transportation Research Part B: Methodological, 45(10), 1749–1767. doi:10.1016/j.trb.2011.07.007
   Web of Science ®Google Scholar
• Jayakrishnan, R., Mahmassani, H.S., & Hu, T.Y. (1994). An evaluation tool for advanced traffic information and management systems in urban networks. Transportation Research C, 2C(3), 129–147.
   Google Scholar
• Kachroo, P., & Özbay, K. (2006). Modeling of network level system-optimal real-time dynamic traffic routing problem using nonlinear H∞ feedback control theoretic approach. Journal of Intelligent Transportation Systems, 10(4), 159–171. doi:10.1080/15472450600981017
   Web of Science ®Google Scholar
• Kaufman, D.E., & Smith, R.L. (1993). Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. I V H S Journal, 1(1), 1–11. doi:10.1080/10248079308903779
   Google Scholar
• Lee, D.-H., Boyce, D.E., & Janson, B.N. (2001). Analysis of lane-blocking events with an analytical dynamic traffic assignment model. IIntelligent Transportation Systems Journal, 6(4), 351–374. doi:10.1080/10248070108903700
   Google Scholar
• Lee, K.-H., Park, H.I., & Lee, I.-B. (2001). A novel nonuniform dicrete time formulation for short-term scheduling of batch and continuous processes. Industrial & Engineering Chemistry Research, 40(22), 4902–4911.
   Web of Science ®Google Scholar
• Lo, H.K., & Szeto, W.Y. (2002a). A cell-based dynamic traffic assignment model: Formulation and properties. Mathematical and Computer Modelling, 35(7–8), 849–865. doi:10.1016/s0895-7177(02)00055-9
   Web of Science ®Google Scholar
• Lo, H.K., & Szeto, W.Y. (2002b). A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transportation Research Part B: Methodological, 36(5), 421–443. doi:10.1016/s0191-2615(01)00011-x
   Web of Science ®Google Scholar
• Merchant, D.K., & Nemhauser, G.L. (1978a). A model and an algorithm for the dynamic traffic assignment problem. Transportation Science, 12(3), 183–199.
   Google Scholar
• Merchant, D.K., & Nemhauser, G.L. (1978b). Optimality conditions for a dynamic traffic assignment model. Transportation Science, 12(3), 200–207.
   Google Scholar
• Muller-Gronbach, T., & Ritter, K. (2007). Lower bounds and nonuniform time discretization for approximation of stochastic heat equations. Foundations of Computational Mathematics, 7(2), 135–181.
   Web of Science ®Google Scholar
• Nagurney, A. (1998). Network economics: A variational inequality approach. Boston, MA: Kluwer Academic.
   Google Scholar
• Nava, E., & Chiu, Y.-C. (2012). A temporal domain decomposition algorithmic scheme for large-scale dynamic traffic assignment. International Journal of Transportation Science and Technology, 1(1), 1–24.
   Google Scholar
• Orda, A., & Rom, R. (1990). Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. Journal of the Association for Compution Machinery, 37(3), 607–625.
   Web of Science ®Google Scholar
• Orda, A., & Rom, R. (1991). Minimum weight paths in time-dependent networks. Networks, 21, 295–320.
   Web of Science ®Google Scholar
• Peeta, S., & Ziliaskopoulos, A.K. (2001). Foundations of dynamic traffic assignment: The past, the present and the future. Networks and Spatial Economics, 1, 233–265.
   Google Scholar
• Ran, B., & Boyce, D.E. (1996). A link-based variational inequlity formulation of ideal dynamic user-optimal route choice problem. Transportation Science, 4C(1), 1–12.
   Google Scholar
• Ran, B., Hall, R.W., & Boyce, D.E. (1996). A link-based variational inequality model for dynamic departure time/route choice. Transportation Science, 30B(1), 31–46.
   Google Scholar
• Ran, B., & Shimazaki, T. (1989). A general model and algorithm for the dynamic traffic assignment problems. Paper presented at the Fifth World Conference on Transport Research, July, Yokohoma, Japan.
   Google Scholar
• Smith, M.J. (1993). A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks. Transportation Research Part B: Methodological, 27(1), 49–63. doi:10.1016/0191-2615(93)90011-x
   Web of Science ®Google Scholar
• Szeto, W.Y., Jiang, Y., & Sumalee, A. (2011). A cell-based model for multi-class doubly stochastic dynamic traffic assignment. Computer-Aided Civil and Infrastructure Engineering, 26(8), 595–611. doi:10.1111/j.1467-8667.2011.00717.x
   Web of Science ®Google Scholar
• Szeto, W.Y., & Lo, H.K. (2004). A cell-based simultaneous route and departure time choice model with elastic demand. Transportation Research Part B: Methodological, 38(7), 593–612. doi:10.1016/j.trb.2003.05.001
   Web of Science ®Google Scholar
• Szeto, W.Y., & Wong, S.C. (2012). Dynamic traffic assignment: model classifications and recent advances in travel choice principles. Central European Journal of Engineering, 2(1), 1–18. doi:10.2478/s13531-011-0057-y
   Google Scholar
• Taylor, N.B. (2003). The CONTRAM dynamic traffic assignment model. Networks and Spatial Economics, 3(2003), 297–322.
   Google Scholar
• Tian, Y., Chiu, Y.-C., & Gao, Y. (2011). Variable time discretization for a time-dependent shortest path algorithm. Paper presented at the IEEE-ITSC, Washington, D.C.
   Google Scholar
• Wie, B.W. (1990). Dynamic Analysis of user optimized network flows with elastic travel demand. Paper presented at the 70th TRB Annual Meeting, January, Washington, DC.
   Google Scholar
• Wie, B.W., Tobin, R.L., Friesz, T.L., & Bernstein, D. (1995). A discrete time, nested cost operation approach to the dynamic network user equilibrium problem. Transportation Science, 29(1), 79–92.
   Web of Science ®Google Scholar
• Wismans, L., van Berkum, E., & Bliemer, M. (2012). Effects of optimizing externalities using cooperating dynamic traffic management measures on network level. Journal of Intelligent Transportation Systems: Technology, Planning, and Operations, 17(1), 65–77.
   Web of Science ®Google Scholar
• Ziliaskopoulos, A.K. (2000). A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation Science, 34(1), 37–49.
   Web of Science ®Google Scholar
• Ziliaskopoulos, A.K., & Mahmassani, H.S. (1993). Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system application. Transportation Research Record, 1408, 94–100.
   Google Scholar
• Ziliaskopoulos, A.K., & Mahmassani, H.S. (1996). A note on least time path computation considering delays and prohibitions for intersection movements. Transportation Research Part B, 30(5), 359–367.
   Google Scholar