System optimum dynamic traffic assignment with departure time choice on two-terminal networks

References

• Arnott, R., and E. de Palma. 2011. “The Corridor Problem: Preliminary Results on the No-Toll Equilibrium.” Transportation Research Part B: Methodological 45 (5): 743–768.
   Web of Science ®Google Scholar
• Arnott, R., A. de Palma, and R. Lindsey. 1990. “Departure Time and Route Choice for the Morning Commute.” Transportation Research Part B: Methodological 24 (3): 209–228.
   Web of Science ®Google Scholar
• Arnott, R., A. de Palma, and R. Lindsey. 1992. “Route Choice with Heterogeneous Drivers and Group-Specific Congestion Costs.” Regional Science and Urban Economics 22 (1): 71–102.
   Web of Science ®Google Scholar
• Arnott, R., A. de Palma, and R. Lindsey. 1993. “Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering.” Transportation Science 27 (2): 148–160.
   Web of Science ®Google Scholar
• Aronson, J. E. 1989. “A Survey of Dynamic Network Flows.” Annals of Operations Research 20: 1–66.
   Google Scholar
• Bookbinder, J. H., and S. P. Sethi. 1980. “The Dynamic Transportation Problem: A Survey.” Naval Research Logistics 27 (3): 447–452.
   Google Scholar
• Braid, R. M. 1996. “Peak-load Pricing of a Transportation Route with an Unpriced Substitute.” Journal of Urban Economics 40 (2): 179–197.
   Web of Science ®Google Scholar
• Burkard, R. E., K. Dlaska, and B. Klinz. 1993. “The Quickest Flow Problem.” ZOR-Methods and Models of Operations Research 37 (1): 31–58.
   Google Scholar
• Carey, M., and A. Srinivasan. 1993. “Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows.” Operations Research 41 (1): 217–231.
   Web of Science ®Google Scholar
• Carey, M., and E. Subrahmanian. 2000. “An Approach to Modelling Time-Varying Flows on Congested Networks.” Transportation Research Part B: Methodological 34 (3): 157–183.
   Web of Science ®Google Scholar
• Carey, M., and D. Watling. 2012. “Dynamic Traffic Assignment Approximating the Kinematic Wave Model: System Optimum, Marginal Costs, Externalities and Tolls.” Transportation Research Part B: Methodological 46 (5): 634–648.
   Web of Science ®Google Scholar
• Chow, A. H. F. 2009a. “Properties of System Optimal Traffic Assignment with Departure Time Choice and its Solution Method.” Transportation Research Part B: Methodological 43 (3): 325–344.
   Web of Science ®Google Scholar
• Chow, A. H. F. 2009b. “Dynamic System Optimal Traffic Assignment – A State-Dependent Control Theoretic Approach.” Transportmetrica A: Transport Science 5 (2): 85–106.
   Google Scholar
• Daganzo, C. F. 1985. “The Uniqueness of a Time-Dependent Equilibrium Distribution of Arrivals at a Single Bottleneck.” Transportation Science 19 (1): 29–37.
   Web of Science ®Google Scholar
• Daganzo, C. F. 1994. “The Cell Transmission Model: A Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory.” Transportation Research Part B: Methodological 28 (4): 269–287.
   Web of Science ®Google Scholar
• de Palma, E., and R. Arnott. 2012. “Morning Commute in a Single-Entry Traffic Corridor with no Late Arrivals.” Transportation Research Part B: Methodological 46 (1): 1–29.
   Web of Science ®Google Scholar
• Doan, K., and S. V. Ukkusuri. 2015. “Dynamic System Optimal Model for Multi-OD Traffic Networks with an Advanced Spatial Queuing Model.” Transportation Research Part C: Emerging Technologies 51: 41–65.
   Web of Science ®Google Scholar
• Drissi-Kaitouni, O., and A. Hameda-Benchekroun. 1992. “A Dynamic Traffic Assignment Model and a Solution Algorithm.” Transportation Science 26 (2): 119–128.
   Web of Science ®Google Scholar
• Fargier, P. H. 1983. “Effects of the Choice of Departure Time on Road Traffic Congestion: Theoretical Approach.” In Proceedings of the 8th International Symposium on Transportation and Traffic Theory, edited by V. F. Hurdle, E. Hauer, and G. N. Steuart, 223–263. Toronto: University of Toronto Press.
   Google Scholar
• Fleischer, L. K. 2001. “Faster Algorithms for the Quickest Transsipment Problem.” SIAM Journal of Optimization 12 (1): 18–35.
   Web of Science ®Google Scholar
• Fleischer, L. K., and M. Skutella. 2007. “Quickest Flows over Time.” SIAM Journal on Computing 36 (6): 1600–1630.
   Web of Science ®Google Scholar
• Ford, L. R., and D. R. Fulkerson. 1958. “Constructing Maximal Dynamic Flows from Static Flows.” Operations Research 6 (3): 419–433.
   Web of Science ®Google Scholar
• Gale, D. 1959. “Transient Flows in Networks.” Michigan Mathematical Journal 6 (1): 59–63.
   Google Scholar
• Ghali, M. O., and M. J. Smith. 1995. “A Model for the Dynamic System Optimum Traffic Assignment Problem.” Transportation Research Part B: Methodological 29 (3): 155–170.
   Web of Science ®Google Scholar
• Hamacher, H. W., and S. Tufekci. 1987. “On the Use of Lexicographic min Cost Flows in Evacuation Modeling.” Naval Research Logistics 34 (3): 487–503.
   Google Scholar
• Hendrickson, C., and G. Kocur. 1981. “Schedule Delay and Departure Time Decisions in a Deterministic Model.” Transportation Science 15 (1): 62–77.
   Web of Science ®Google Scholar
• Heydecker, B. G., and J. D. Addison. 2005. “Analysis of Dynamic Traffic Equilibrium with Departure Time Choice.” Transportation Science 39 (1): 39–57.
   Web of Science ®Google Scholar
• Hoppe, B., and E. Tardos. 2000. “The Quickest Transshipment Problem.” Mathematics of Operations Research 25 (1): 36–62.
   Web of Science ®Google Scholar
• Hsu, Y.-T., and S. Peeta. 2014. “Risk-Based Spatial Zone Determination Problem for Stage-Based Evacuation Operations.” Transportation Research Part C: Emerging Technologies 41: 73–89.
   Web of Science ®Google Scholar
• Hurdle, V. F., and D. Buckley. 1974. “The Effect of Queueing on Traffic Assignment in a Simple Road Network.” In Proceedings of the 6th International Symposium on Transportation and Traffic Theory, edited by D. J. Buckley, 519–540. Sydney: Elsevier.
   Google Scholar
• Jarvis, J. J., and H. D. Ratliff. 1982. “Some Equlivalent Objectives for Dynamic Network Flow Problems.” Management Science 28 (1): 106–109.
   Web of Science ®Google Scholar
• Kuwahara, M. 1990. “Equilibrium Queueing Patterns at a two-Tandem Bottleneck During the Morning Peak.” Transportation Science 24 (3): 217–229.
   Web of Science ®Google Scholar
• Kuwahara, M. 2007. “A Theory and Implications on Dynamic Marginal Cost.” Transportation Research Part A: Policy and Practice 41 (7): 627–643.
   Web of Science ®Google Scholar
• Laval, J. A., H. W. Cho, J. C. Munoz, and Y. Yin. 2015. “Real-time Congestion Pricing Strategies for Toll Facilities.” Transportation Research Part B: Methodological 71: 19–31.
   Web of Science ®Google Scholar
• Lovell, D. J., and C. F. Daganzo. 2000. “Access Control on Networks with Unique Origin-Destination Paths.” Transportation Research Part B: Methodological 34 (3): 185–202.
   Web of Science ®Google Scholar
• Ma, R., and H. M. Zhang. 2017. “The Morning Commute Problem with Ridesharing and Dynamic Parking Charges.” Transportation Research Part B: Methodological 106: 345–374.
   Web of Science ®Google Scholar
• Minieka, E. 1973. “Maximal, Lexicographic, and Dynamic Network Flows.” Operations Research 21 (2): 517–527.
   Web of Science ®Google Scholar
• Munoz, J. C., and J. A. Laval. 2006. “System Optimum Dynamic Traffic Assignment Graphical Solution Method for a Congested Freeway and one Destination.” Transportation Research Part B: Methodological 40 (1): 1–15.
   Web of Science ®Google Scholar
• Newell, C. F. 1987. “The Morning Commute for Nonidentical Travelers.” Transportation Science 21 (2): 74–88.
   Web of Science ®Google Scholar
• Ngoduy, D., N. H. Hoang, H. L. Vu, and D. Walting. 2016. “Optimal Queue Placement in Dynamic System Optimum Solutions for Single Origin-Destination Traffic Networks.” Transportation Research Part B: Methodological 92: 148–169.
   Web of Science ®Google Scholar
• Peeta, S., and H. S. Mahmassani. 1995. “System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks.” Annals of Operations Research 60 (1): 81–113.
   Google Scholar
• Philpott, A. B. 1990. “Continuous Time Flows in Networks.” Mathematics of Operations Research 15 (4): 640–661.
   Web of Science ®Google Scholar
• Powell, W. B., P. Jaillet, and A. Odoni. 1995. “Stochastic and Dynamic Networks and Routing.” In Handbooks in Operations Research and Management Science, edited by M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, 141–295. Elsevier Science Publishers.
   Google Scholar
• Qian, S., W. Shen, and H. M. Zhang. 2012. “System-optimal Dynamic Traffic Assignment with and Without Queue Spillback: Its Path-Based Formulation and Solution via Approximate Path Marginal Cost.” Transportation Research Part B: Methodological 46 (7): 874–893.
   Web of Science ®Google Scholar
• Qian, S., and H. M. Zhang. 2013. “The Morning Commute Problem with Heterogeneous Travellers: The Case of Continuously Distributed Parameters.” Transportmetrica A: Transport Science 9 (2): 178–203.
   Web of Science ®Google Scholar
• Ramadurai, G., S. V. Ukkusuri, J. Zhao, and J.-S. Pang. 2010. “Linear Complementarity Formulation for Single Bottleneck Model with Heterogeneous Commuters.” Transportation Research Part B: Methodological 44 (2): 193–214.
   Web of Science ®Google Scholar
• Shen, W. 2008. “System Optimal Dynamic Traffic Assignment: A Graph-Theoretic Approach and its Engineering Application.” PhD thesis, University of California at Davis, Davis, CA.
   Google Scholar
• Shen, W., Y. Nie, and H. M. Zhang. 2007. “On Path Marginal Cost Analysis and its Relation to Dynamic System-Optimal Traffic Assignment.” In Proceedings of the 17th International Symposium of Transportation and Traffic Theory, edited by R. E. Allsop, M. G. H. Bell, and G. H. Benjamin, 327–360. London: Elsevier.
   Google Scholar
• Shen, W., and H. M. Zhang. 2009. “On the Morning Commute Problem in a Corridor Network with Multiple Bottlenecks: Its System-Optimal Traffic Flow Patterns and the Realizing Tolling Scheme.” Transportation Research Part B: Methodological 43 (3): 267–284.
   Web of Science ®Google Scholar
• Shen, W., and H. M. Zhang. 2014. “System Optimal Dynamic Traffic Assignment: Properties and Solution Procedure in the Case of Many-to-one Network.” Transportation Research Part B: Methodological 65: 1–17.
   Web of Science ®Google Scholar
• Small, K. 1982. “The Scheduling of Consumer Activities: Work Trips.” American Economic Review 72 (3): 467–479.
   Web of Science ®Google Scholar
• Smeed, R. J. 1967. “Some Circumstances in Which Vehicles Will Reach Their Destinations Earlier by Starting Later.” Transportation Science 1 (4): 308–317.
   Google Scholar
• Smith, M. J. 1984. “The Existence of a Time-Dependent Equilibrium Distribution of Arrivals at a Single Bottleneck.” Transportation Science 18 (4): 385–394.
   Web of Science ®Google Scholar
• Vickrey, W. S. 1969. “Congestion Theory and Transport Investment.” The American Economic Review 59 (2): 251–261.
   Web of Science ®Google Scholar
• Vickrey, W. S. 1973. “Pricing, Metering, and Efficently Using Urban Transportation Facilities.” Highway Research Record 476: 36–48.
   Google Scholar
• Wilkinson, W. L. 1971. “An Algorithm for Universal Maximal Dynamic Flows in a Network.” Operations Research 19 (7): 1602–1612.
   Web of Science ®Google Scholar
• Yang, H., and H.-J. Huang. 1997. “Analysis of the Time-Varying Pricing of a Bottleneck with Elastic Demand Using Optimal Control Theory.” Transportation Research Part B: Methodological 31 (6): 425–440.
   Web of Science ®Google Scholar
• Yang, H., and Q. Meng. 1998. “Departure Time, Route Choice and Congstion Toll in a Queuing Network with Elastic Demand.” Transportation Research Part B: Methodological 32 (4): 247–260.
   Web of Science ®Google Scholar
• Yang, H., W. Liu, X. Wang, and X. Zhang. 2013. “On the Morning Commute Problem with Bottleneck Congestion and Parking Space Constraints.” Transportation Research Part B: Methodological 58: 106–118.
   Web of Science ®Google Scholar
• Zadeh, N. 1973. “A Bad Network Problem for the Simplex Method and Other Minimum Cost Flow Algorithms.” Mathematical Programming 5 (1): 255–266.
   Google Scholar
• Zhang, H. M., and W. Shen. 2010. “Access Control Policies Without Inside Queues: Their Properties and Public Policy Implications.” Transportation Research Part B: Methodological 44 (8-9): 1132–1147.
   Web of Science ®Google Scholar
• Zheng, H. 2009. “Efficient Algorithms for the Cell-Based Single Destiantion System Optimal Dynamic Traffic Assignment Problem.” PhD thesis, University of Arizona, Tucson, AZ.
   Google Scholar
• Zheng, H., and Y.-C. Chiu. 2011. “A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem.” Transportation Science 45 (1): 121–137.
   Web of Science ®Google Scholar
• Zheng, H., Y.-C. Chiu, and P. B. Mirchandani. 2014. “A Heuristic Algorithm for the Earliest Arrival Flow with Multiple Sources.” Journal of Mathematical Modelling and Algorithms in Operations Research 13 (2): 169–189.
   Google Scholar
• Zheng, H., Y.-C. Chiu, and P. B. Mirchandani. 2015. “On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems.” Transportation Science 49 (1): 13–27.
   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