Measuring inefficiency in dynamic traffic networks: a numerical study

References

• Anshelevich E and Ukkusuri S. 2009. Equilibria in dynamic selfish routing. Lecture Notes in Computer Science, 5814, pp.171–82.
   Google Scholar
• Arnott R, de Palma A and Lindsey R. 1988. Schedule delay and departure time decisions with heterogeneous commuters. Transportation Research Record, 1197, pp.56–67.
   Google Scholar
• Arnott R, de Palma A and Lindsey R. 1993. A structural model of peak-period congestion: a traffic bottleneck with elastic demand. The American Economic Review, 83(1), pp.161–79.
   Web of Science ®Google Scholar
• Arnott R, de Palma A and Lindsey R. 1994. A welfare congestion tolls with heterogenous commuters. Journal of Transportation Economics and Policy, 28(2), pp.139–61.
   Web of Science ®Google Scholar
• Ban XJ, Liu HX, Ferris MC and Ran B. 2008. A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations. Transportation Research Part B, 42(9), pp.823–42.
   Google Scholar
• Carey M. 1986. A constraint qualification for a dynamic traffic assignment model. Transportation Science, 20(1), pp.55–8.
   Web of Science ®Google Scholar
• Carey M. 1987. Optimal time varying flows on congested network. Operation Research, 35(1), pp.58–69.
   Web of Science ®Google Scholar
• Carey M. 1992. Nonconvexity of the dynamic traffic assignment problem. Transportation Research Part B, 26(2), pp.127–33.
   Google Scholar
• Chau CK and Sim KM. 2003. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Operations Research Letters, 31(5), pp.327–34.
   Web of Science ®Google Scholar
• Daganzo CF. 1985. The uniqueness of a time-dependent equilibrium distribution of arrivals at a single bottleneck. Transportation Science, 19(1), pp.29–37.
   Web of Science ®Google Scholar
• Daganzo CF. 1994. The cell transmission model: a simple dynamic representation of highway traffic. Transportation Research Part B, 28(4), pp.269–87.
   Google Scholar
• Daganzo CF. 1995. The cell transmission model, part ii: network traffic. Transportation Research Part B, 29(2), pp.79–93.
   Google Scholar
• Doan K and Ukkusuri S. 2012. On the holding-back problem in the cell transmission based dynamic traffic assignment models. Transportation Research Part B, 46(9), pp.1218–38.
   Google Scholar
• Doan K and Ukkusuri S (in review) Dynamic system optimal for general network embedding cell transmission model.
   Google Scholar
• Doan K, Ukkusuri S and Han L. 2011. On the existence of pricing strategies in the discrete time heterogeneous single bottleneck model. Transportation Research Part B, 45(9), pp.1483–500.
   Google Scholar
• Friesz TL, Bernstein D, Smith TE, Tobin RL and Wie B. 1993. A variational inequality formulation of the dynamic network user equilibrium problem. Operation Research, 41(1), pp.179–91.
   Web of Science ®Google Scholar
• Friesz TL, Han K, Neto PA, Meimand A and Yao T. 2013. Dynamic user equilibrium based on a hydrodynamic model. Transportation Research Part B, 47, pp.102–26.
   Google Scholar
• Friesz TL, Luque J, Tobin RL and Wie B-W. 1989. Dynamic network traffic assignment considered as a continuous time optimal control problem. Operations Research, 37(6), pp.893–901.
   Web of Science ®Google Scholar
• Ghali MO and Smith MJ. 1995. A model for the dynamic system optimum traffic assignment problem. Transportation Research Part B, 29(3), pp.155–70.
   Google Scholar
• Han D, Lo HK, Sun J and Yang H. 2008a. The toll effect on price of anarchy when costs are nonlinear and asymmetric. European Journal of Operational Research, 186(1), pp.300–16.
   Web of Science ®Google Scholar
• Han D, Lo HK and Yang H. 2008b. On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands. Computers and Mathematics with Applications, 56(10), pp.2737–43.
   Web of Science ®Google Scholar
• Han L, Ukkusuri SV and 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, 45(10), pp.1749–67.
   Google Scholar
• Jayakrishnan R, Mahmassani HS and Hu T-Y. 1994. An evaluation tool for advanced traffic information and management systems in urban networks. Transportation Research Part C, 2(3), pp.129–47.
   Google Scholar
• Karakostas G, Kim T, Viglas A and Xia H. 2011. On the degradation of performance for traffic networks with oblivious users. Transportation Research Part B, 45(2), pp.364–71.
   Google Scholar
• Koutsoupias E and Papadimitriou C., 1999. Worst-case equilibria. In: Proceedings of the 16th annual symposium on theoretical aspects of computer science.
   Google Scholar
• Liu Y and Nie YM. 2010. Morning commute problem considering route choice, user heterogeneity and alternative system optima. Transportation Research Part B, 45(4), pp. 619–42.
   Google Scholar
• Lo HK and Szeto W. 2002. A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transportation Research Part B, 36(5), pp. 421–43.
   Google Scholar
• Lu C-C, Mahmassani HS and Zhou X. 2008. A bi-criterion dynamic user equilibrium traffic assignment model and solution algorithm for evaluating dynamic road pricing strategies. Transportation Research Part C, 16, pp.371–89.
   Web of Science ®Google Scholar
• Merchant DK and Nemhauser GL. 1978a. A model and an algorithm for the dynamic traffic assignment problems. Transportation Science, 12(3), pp.183–99.
   Google Scholar
• Merchant DK and Nemhauser GL. 1978b. Optimality conditions for a dynamic traffic assignment model. Transportation Science, 12(3), pp.200–207.
   Google Scholar
• Nie YM., 2006. A variational inequality approach for inferring dynamic origin–destination travel demands. Ph.D. thesis. Davis: University of California.
   Google Scholar
• Nie YM and Zhang HM. 2010. Solving the dynamic user optimal assignment problem considering queue spillback. Net, 10(1), pp.49–71.
   Web of Science ®Google Scholar
• Peeta S and Mahmassani HS. 1995. System optimal and user equilibrium time-dependent traffic assignment in congested networks. Annals of Operations Research, 60(1), pp.81–113.
   Web of Science ®Google Scholar
• Qian ZS, Shen W and 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 Research Part B, 46(7), pp.874–93.
   Google Scholar
• Ramadurai G., 2009. Novel dynamic user equilibrium models: analytical formulations, multi-dimensional choice, and an efficient algorithm. Ph.D. thesis. Troy, NY: Department of Civil and Environmental Engineering, Rensselaer Polytechnic Institute.
   Google Scholar
• Ramadurai G, Ukkusuri SV, Zhao S and Pang J-S. 2010. Linear complementarity formulation for single bottleneck model with heterogeneous commuters. Transportation Research Part B, 44(2), pp.193–214.
   Google Scholar
• Ran B, Boyce DE and LeBlanc LJ. 1993. A new class of instantaneous dynamic user-optimal traffic assignment models. Operations Research, 41(1), pp.192–202.
   Web of Science ®Google Scholar
• Roughgarden T., 2002. Selfish routing. Ph.D. thesis. Cornell University.
   Google Scholar
• Roughgarden T and Tardos E. 2002. How bad is selfish routing? Journal of the ACM, 49(2), pp.236–59.
   Web of Science ®Google Scholar
• Shen W, Nie YM, Zhang H., 2006. Path-based system optimal dynamic traffic assignment models: formulation and solution methods. In: Proceedings of the IEEE ITSC 2006, pp.1298–303.
   Google Scholar
• Shen W, Nie YM, Zhang H., 2007. On path marginal cost analysis and its relation to dynamic system-optimal traffic assignment. In: Proceedings of the 17th international symposium of transport and traffic theory, pp. 327–60.
   Google Scholar
• Small K. 1982. The scheduling of consumer activities: work trips. The American Economic Review, 72(3), pp.467–79.
   Web of Science ®Google Scholar
• Smith M. 2013. A link-based elastic demand equilibrium model with capacity constraints and queuing delays. Transportation Research Part C, 29, pp.131–47.
   Web of Science ®Google Scholar
• Ukkusuri S., 2002. Linear programs for the user optimal dynamic traffic assignment problem. Master's thesis. University of Illinois at Urbana-Champaign.
   Google Scholar
• Ukkusuri S, Han L and Doan K. 2012. Dynamic user equilibrium with a path based cell transmission model for general traffic networks. Transportation Research Part B, 46(10), pp.1657–84.
   Google Scholar
• Vickrey WS. 1969. Congestion theory and transport investment. The American Economic Review, 59(2), pp.251–61.
   Web of Science ®Google Scholar
• Yperman I., 2007. The link transmission model for dynamic network loading. Ph.D. thesis. University of Leuven Energy Institute.
   Google Scholar
• Zhan X and Ukkusuri S., 2014. Multi-user class, simultaneous route and departure time choice dynamic traffic assignment with an embedded spatial queuing model. In: Presented at 5th international symposium on dynamic traffic assignment.
   Google Scholar
• Ziliaskopoulos AK. 2000. A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation Science, 34(1), pp.37–49.
   Web of Science ®Google Scholar