Discrete-Time System Optimal Dynamic Traffic Assignment (SO-DTA) with Partial Control for Physical Queuing Networks

References

• Aswani A, Tomlin C (2011) Game-theoretic routing of GPS-assisted vehicles for energy efficiency. Amer. Control Conf. (ACC), 3375–3380.Google Scholar
• Bast H, Delling D, Goldberg A, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2016) Route planning in transportation networks. Kliemann L, Sanders P, eds. Algorithm Engineering, Lecture Notes Comput. Sci., Vol. 9220 (Springer International Publishing, Cham, Switzerland), 19–80.Crossref, Google Scholar
• Bayen AM, Raffard RL, Tomlin CJ (2006) Adjoint-based control of a new Eulerian network model of air traffic flow. IEEE Trans. Control Systems Tech. 14(5):804–818.Crossref, Google Scholar
• Beckman M, McGuire CB, Winsten CB (1956) Studies in the Economics of Transportation (Yale University Press, New Haven, CT).Google Scholar
• Bertsekas DP (1999) Nonlinear Programming (Athena Scientific, Belmont, MA).Google Scholar
• Boese KD, Kahng AB, Muddu S (1994) A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16(2):101–113.Crossref, Google Scholar
• Braess D (1968) Über ein Paradoxon aus der Verkehrsplanung. Math. Methods Oper. Res. 12(1):258–268.Crossref, Google Scholar
• Carey M (1992) Nonconvexity of the dynamic traffic assignment problem. Transportation Res. Part B: Methodological 26(2):127–133.Crossref, Google Scholar
• Carey M, Watling D (2012) Dynamic traffic assignment approximating the kinematic wave model: System optimum, marginal costs, externalities and tolls. Transportation Res. Part B: Methodological 46(5):634–648.Crossref, Google Scholar
• Chen C, Petty K, Skabardonis A, Varaiya P, Jia Z (2001) Freeway performance measurement system: Mining loop detector data. Transportation Res. Record: J. Transportation Res. Board 1748(1):96–102.Crossref, Google Scholar
• Daganzo C (1994) The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory. Transportation Res. Part B: Methodological 28(4):269–287.Crossref, Google Scholar
• Daganzo C (1995) The cell transmission model, part II: Network traffic. Transportation Res. Part B: Methodological 29(2):79–93.Crossref, Google Scholar
• Delle Monache ML, Reilly J, Samaranayake S, Krichene W, Goatin P, Bayen AM (2014) A pde-ode model for a junction with ramp buffer. SIAM J. Appl. Math. 74(1):22–39.Crossref, Google Scholar
• Dervisoglu G, Gomes G, Kwon J, Horowitz R, Varaiya P (2009) Automatic calibration of the fundamental diagram and empirical observations on capacity. Transportation Res. Board 88th Annual Meeting, Washington, DC.Google Scholar
• Duffy A (2009) An introduction to gradient computation by the discrete adjoint method. Technical report, Florida State University, Tallahassee.Google Scholar
• Friesz TL, Bernstein D, Smith TE, Tobin RL, Wie B (1993) A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41(1):179–191.Link, Google Scholar
• Friesz TL, Han K, Neto PA, Meimand A, Yao T (2013) Dynamic user equilibrium based on a hydrodynamic model. Transportation Res. Part B: Methodological 47:102–126.Crossref, Google Scholar
• Garavello M, Piccoli B (2006) Traffic Flow on Networks (American Institute of Mathematical Sciences, Springfield, MO).Google Scholar
• Garavello M, Piccoli B (2009) Conservation laws on complex networks. Annales de l’Institut Henri Poincare (C) Non Linear Analysis, 26(5):1925–1951.Crossref, Google Scholar
• Giles MBM, Pierce NAN (2000) An introduction to the adjoint approach to design. Flow, Turbulence Combustion 65(3):393–415.Crossref, Google Scholar
• Giles MBMB, Pierce NAN (1997) Adjoint equations in CFD: Duality, boundary conditions and solution behaviour. AIAA Paper 97–1850.Google Scholar
• Godunov SK (1959) A difference method for numerical calculation of discontinuous solutions of the equations of hydrodynamics. Matematicheskii Sbornik 89(3):271–306.Google Scholar
• Gomes G, Horowitz R (2006) Optimal freeway ramp metering using the asymmetric cell transmission model. Transportation Res. Part C: Emerging Tech. 14(4):244–262.Crossref, Google Scholar
• Han K, Friesz TL, Yao T (2013) Existence of simultaneous route and departure choice dynamic user equilibrium. Transportation Res. Part B: Methodological 53:17–30.Crossref, Google Scholar
• Han K, Piccoli B, Friesz TL (2016) Continuity of the path delay operator for dynamic network loading with spillback. Transportation Res. Part B: Methodological 92:211–233.Crossref, Google Scholar
• Jameson A, Martinelli L (2000) Aerodynamic shape optimization techniques based on control theory. Capasso V, Engl HW, Periaux J, eds. Computational Mathematics Driven by Industrial Problems, Lecture Notes Math., Vol. 1739 (Springer, Berlin Heidelberg), 151–221.Crossref, Google Scholar
• Kelly FP (1991) Network routing. Philos. Trans. Roy. Soc. London. Ser. A: Phys. Engrg. Sci. 337(1647):343–367.Crossref, Google Scholar
• Korilis YA, Lazar AA, Orda A (1997) Achieving network optima using Stackelberg routing strategies. IEEE/ACM Trans. Networking 5(1):161–173.Crossref, Google Scholar
• Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. Meinel C, Tison S, eds. Proc. 16th Annual Conf. Theoret. Aspects Comput. Sci. (Springer, Berlin Heidelberg), 404–413.Google Scholar
• Krichene W, Reilly J, Amin S, Bayen AM (2013) Stackelberg routing on parallel networks with horizontal queues. IEEE Trans. Automatic Control 59(3):714–727.Crossref, Google Scholar
• Leveque R (2002) Finite Volume Methods for Hyperbolic Problems (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Li Y, Waller ST, Ziliaskopoulos T (2003) A decomposition scheme for system optimal dynamic traffic assignment models. Networks Spatial Econom. 3(4):441–455.Crossref, Google Scholar
• Lighthill MJ, Whitham GB (1955) On kinematic waves. II. A theory of traffic flow on long crowded roads. Proc. Roy. Soc. London. Ser. A. Math. Phys. Sci. 229(1178):317–345.Crossref, Google Scholar
• Lo HK, Szeto WY (2002) A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transportation Res. Part B: Methodological 36(5):421–443.Crossref, Google Scholar
• Marti R (2003) Multi-start methods. Glover F, Kochenberger GA, eds. Handbook of Metaheuristics, Internat. Series Oper. Res. Management Sci., Vol. 57 (Springer, Boston), 355–368.Crossref, Google Scholar
• Merchant DK, Nemhauser GL (1978a) A model and an algorithm for the dynamic traffic assignment problems. Transportation Sci. 12(3):183–199.Link, Google Scholar
• Merchant DK, Nemhauser GL (1978b) Optimality conditions for a dynamic traffic assignment model. Transportation Sci. 12(3):183–199.Link, Google Scholar
• Monache MLD, Goatin P, Piccoli B (2016) Priority-based Riemann solver for traffic flow on networks. arXiv preprint arXiv:1606.07418.Google Scholar
• Morton KW, Mayers DF (2005) Numerical Solution of Partial Differential Equations: An Introduction (Cambridge University Press, New York).Crossref, Google Scholar
• Nie YM (2011) A cell-based Merchant–Nemhauser model for the system optimum dynamic traffic assignment problem. Transportation Res. Part B: Methodological 45(2):329–342.Crossref, Google Scholar
• Peeta S, Ziliaskopoulos A (2001) Foundations of dynamic traffic assignment: The past, the present and the future. Networks Spatial Econom. 1(3–4):233–265.Crossref, Google Scholar
• Qian ZS, Shen W, Zhang H (2012) System-optimal dynamic traffic assignment with and without queue spillback: Its path-based formulation and solution via approximate path marginal cost. Transportation Res. Part B: Methodological 46(7):874–893.Crossref, Google Scholar
• Raffard R (2008) An adjoint-based parameter identification algorithm applied to planar cell polarity signaling. IEEE Trans. Automatic Control 53:109–121.Crossref, Google Scholar
• Reilly J, Samaranayake S, Delle Monache M, Krichene W, Goatin P, Bayen A (2015) Adjoint-based optimization on a network of discretized scalar conservation laws with applications to coordinated ramp metering. J. Optim. Theory Appl. 167(2):733–760.Crossref, Google Scholar
• Richards PI (1956) Shock waves on the highway. Oper. Res. 4(1):42–51.Link, Google Scholar
• Riedmiller M, Braun H (1992)Rprop-a fast adaptive learning algorithm. Proc. Internat. Sympos. Comput. Inform. Sci. VII, Universitat.Google Scholar
• Roughgarden T (2001) Stackelberg scheduling strategies. Proc. Thirty-Third Annual ACM Sympos. Theory Comput. (ACM, New York) 104–113.Google Scholar
• Roughgarden T (2002) The price of anarchy is independent of the network topology. Proc. Thirty-Fourth Annual ACM Sympos. Theory Comput. (ACM, New York), 428–437.Google Scholar
• Roughgarden T (2006) On the severity of Braess’s paradox: Designing networks for selfish users is hard. J. Comput. System Sci. 72(5): 922–953.Crossref, Google Scholar
• Roughgarden T, Tardos É (2004) Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econom. Behav. 47(2): 389–403.Crossref, Google Scholar
• Smith M, Wisten M (1995) A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium. Ann. Oper. Res. 60(1):59–79.Crossref, Google Scholar
• Swamy C (2007) The effectiveness of Stackelberg strategies and tolls for network congestion games. Proc. Eighteenth Annual ACM-SIAM Sympos. Discrete Algorithms, Vol. 7 (SIAM, Philadelphia), 1133–1142.Google Scholar
• Ukkusuri SV, Han L, Doan K (2012) Dynamic user equilibrium with a path based cell transmission model for general traffic networks. Transportation Res. Part B: Methodological 46(10):1657–1684.Crossref, Google Scholar
• Vickrey WS (1969) Congestion theory and transport investment. Amer. Econom. Rev. 59(2):251–260.Google Scholar
• Wachter A, Biegler LT (2005) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar
• Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc. Institution Civil Engineers 1:325–378.Crossref, Google Scholar
• Wie B-W, Tobin RL, Carey M (2002) The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation. Transportation Res. Part B: Methodological 36(10):897–918.Crossref, Google Scholar
• Ziliaskopoulos AK (2000) A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation Sci. 34(1):37–49.Link, Google Scholar