Travel times in quasi-dynamic traffic assignment

References

• Bakker, D., P. Mijjer, and F. Hofman. 1994. “QBLOK: een toedelingsmethodiek voor het modelleren van de afhankelijkheid tussen knelpunten en de voorspelling van blokkades.” In Colloquium Vervoersplanologisch Speurwerk 7994. Colloquium Vervoersplanologisch Speurwerk, edited by J. M. Jager, 313–332. Amsterdam.
   Google Scholar
• Bellman, R. 1958. “On a Routing Problem.” Quarterly of Applied Mathematics 16 (1): 87–90. doi: 10.1090/qam/102435
   Google Scholar
• Bifulco, G. N., and U. Crisalli. 1998. “Stochastic User Equilibrium and Link Capacity Constraints: Formulation and Theoretical Evidencies.” Proceedings of the European Transport Conference, Loughborough, UK, 85–96.
   Google Scholar
• Bliemer, M. C. J., M. P. H. Raadsen, E. Smits, B. Zhou, and M. G. H. Bell. 2014. “Quasi-Dynamic Traffic Assignment with Residual Point Queues Incorporating a First Order Node Model.” Transportation Research Part B 68: 363–384. doi: 10.1016/j.trb.2014.07.001
   Google Scholar
• Brederode, L., A. Pel, L. Wismans, E. De Romph, and S. Hoogendoorn. 2019. “Static Traffic Assignment with Queuing: Model Properties and Applications.” Transportmetrica A: Transport Science 15 (2): 179–214. doi: 10.1080/23249935.2018.1453561
   Web of Science ®Google Scholar
• Bundschuh, M., P. Vortisch, and T. Van Vuuren. 2006. “Modelling Queues in Static Traffic Assignment.” European Transport Conference, Strasbourg, France.
   Google Scholar
• Bureau of Public Roads, ed. 1964. “Theory.” In Traffic Assignment Manual for Application with a Large, High Speed Computer, V1–V24. Washington, DC: U.S. Government Printing Office.
   Google Scholar
• Cascetta, E., A. Nuzzolo, F. Russo, and A. Vitetta. 1996. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems. Specification and Some Calibration Results for Interurban Networks, 697–711. Oxford: Pergamon.
   Google Scholar
• Daganzo, C. F. 1995. “The Cell Transmission Model, Part II: Network Traffic.” Transportation Research Part B 29 (2): 79–93. doi: 10.1016/0191-2615(94)00022-R
   Google Scholar
• Daganzo, C. F., and Y. Sheffi. 1977. “On Stochastic Models of Traffic Assignment.” Transportation Science 11 (3): 253–274. doi: 10.1287/trsc.11.3.253
   Google Scholar
• Dijkstra, E. W. 1959. “A Note on Two Problems in Connexion with Graphs.” Numerische Mathematik 1 (1): 269–271. doi: 10.1007/BF01386390
   Google Scholar
• Ford, L. R. 1956. Network Flow Theory, P-923. Santa Monica, CA: RAND Corporation.
   Google Scholar
• Gentile, G. 2018. “New Formulations of the Stochastic User Equilibrium with Logit Route Choice as an Extension of the Deterministic Model.” Transportation Science 52 (6): 1297–1588. doi: 10.1287/trsc.2018.0839
   Web of Science ®Google Scholar
• Gentile, G., P. Velonà, and G. E. Cantarella. 2014. “Uniqueness of Stochastic User Equilibrium with Asymmetric Volume-Delay Functions for Merging and Diversion.” EURO Journal on Transportation and Logistics 3 (3-4): 309–331. doi: 10.1007/s13676-013-0042-0
   Google Scholar
• Hart, P. E., N. J. Nilsson, and B. Raphael. 1968. “A Formal Basis for the Heuristic Determination of Minimum Cost Paths.” IEEE Transactions on Systems Science and Cybernetics 4 (2): 100–107. doi: 10.1109/TSSC.1968.300136
   Web of Science ®Google Scholar
• Lam, W. H. K., and Y. Zhang. 2000. “Capacity-Constrained Traffic Assignment in Networks with Residual Queues.” Journal of Transportation Engineering 126 (2): 121–128. doi: 10.1061/(ASCE)0733-947X(2000)126:2(121)
   Google Scholar
• Lebacque, J. P., and M. M. Khoshyaran. 2005. “First-Order Macroscopic Traffic Flow Models: Intersection Modeling, Network Modeling.” In Transportation and Traffic Theory: Flow, Dynamics and Human Interaction - Proceedings of the 16th International Symposium on Transportation and Traffic Theory, edited by H. S. Mahmassani, 365–386. Oxford: Elsevier.
   Google Scholar
• Lighthill, M. J., and G. B. Whitham. 1955. “On Kinematic Waves II. A Theory of Traffic Flow on Long Crowded Roads.” Proceedings of the Royal Society of London A 229 (1178): 317–345.
   Google Scholar
• Nakayama, S., and R. Connors. 2014. “A Quasi-Dynamic Assignment Model That Guarantees Unique Network Equilibrium.” Transportmetrica A 10 (7): 669–692. doi: 10.1080/18128602.2012.751685
   Web of Science ®Google Scholar
• Raadsen, M. P. H., and M. C. J. Bliemer. 2018. General Solution Scheme for the Static Link Transmission Model (ITLS-WP-18-21). Sydney: Institute of Transport and Logistics Studies.
   Google Scholar
• Raadsen, M. P. H., M. C. J. Bliemer, and M. G. H. Bell. 2016. “An Efficient and Exact Event-Based Algorithm for Solving Simplified First Order Dynamic Network Loading Problems in Continuous Time.” Transportation Research Part B 92 (B): 191–210. doi: 10.1016/j.trb.2015.08.004
   Google Scholar
• Richards, P. I. 1956. “Shock Waves on the Highway.” Operations Research 4 (1): 42–51. doi: 10.1287/opre.4.1.42
   Web of Science ®Google Scholar
• Smulders, S. 1990. “Control of Freeway Traffic Flow by Variable Speed Signs.” Transportation Research Part B 24B (2): 111–132. doi: 10.1016/0191-2615(90)90023-R
   Google Scholar
• Tajtehranifard, H., A. Bhaskar, N. Nassir, M. M. Haque, and E. Chung. 2018. “A Path Marginal Cost Approximation Algorithm for System Optimal Quasi-Dynamic Traffic Assignment.” Transportation Research Part C 88: 91–106. doi: 10.1016/j.trc.2018.01.002
   Web of Science ®Google Scholar
• Tampère, C. M. J., R. Corthout, D. Cattrysse, and L. H. Immers. 2011. “A Generic Class of First Order Node Models for Dynamic Macroscopic Simulation of Traffic Flows.” Transportation Research Part B 45 (1): 289–309. doi: 10.1016/j.trb.2010.06.004
   Google Scholar