An Efficient Algorithm for Continuous Bi-Criteria Traffic Assignment

References

• Arnott R, de Palma A, Lindsey R (1992) Route choice with heterogeneous drivers and group-specific congestion costs. Regional Sci. Urban Econom. 22(1):71–102.Crossref, Google Scholar
• Bar-Gera H (2010) Traffic assignment by paired alternative segments. Transportation Res. Part B: Methodological 44(8–9):1022–1046.Crossref, Google Scholar
• Beckmann M, McGuire C, Winsten C (1956) Studies in the Economics of Transportation (Yale University Press, New Haven, CT).Google Scholar
• Blum JR (1954) Multidimensional stochastic approximation methods. Ann. Math. Statist. 25(4):737–744.Crossref, Google Scholar
• Calderone D, Ratliff LJ (2019) Multi-dimensional continuous type population potential games. Proc. IEEE 58th Conf. Decision Control (IEEE, Piscataway, NJ), 5138–5143.Google Scholar
• Calderone D, Dong R, Sastry SS (2017) External-cost continuous-type Wardrop equilibria in routing games. Proc. IEEE 20th Internat. Conf. Intelligent Transportation Systems (IEEE, Piscataway, NJ).Google Scholar
• Chen PW, Nie YM (2013) Bicriterion shortest path problem with a general nonadditive cost. Transportation Res. Part B: Methodological 57:419–435.Google Scholar
• Dafermos SC (1971) An extended traffic assignment model with applications to two-way traffic. Transportation Sci. 5(4):366–389.Link, Google Scholar
• Dafermos SC (1972) The traffic assignment problem for multiclass-user transportation networks. Transportation Sci. 6(1):73–87.Link, Google Scholar
• Dafermos SC (1981) A Multicriteria Route-Mode Choice Traffic Equilibrium Model, Lefschetz Center for Dynamical Systems (Brown University, Providence, RI).Google Scholar
• Daganzo CF (1983) Stochastic network equilibrium with multiple vehicle types and asymmetric, indefinite link cost Jacobians. Transportation Sci. 17(3):282–300.Link, Google Scholar
• Dembo RS, Steihaug T (1983) Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Programming 26(2):190–212.Crossref, Google Scholar
• Dial RB (1979) A model and algorithm for multicriteria route-mode choice. Transportation Res. Part B: Methodological 13(4):311–316.Crossref, Google Scholar
• Dial RB (1996) Bicriterion traffic assignment: Basic theory and elementary algorithms. Transportation Sci. 30(2):93–111.Link, Google Scholar
• Dial RB (1997) Bicriterion traffic assignment: Efficient algorithms plus examples. Transportation Res. Part B: Methodological 31(5):357–379.Crossref, Google Scholar
• Dial RB (1999a) Network-optimized road pricing: Part I: A parable and a model. Oper. Res. 47(1):54–64.Link, Google Scholar
• Dial RB (1999b) Network-optimized road pricing: Part II: Algorithms and examples. Oper. Res. 47(2):327–336.Link, Google Scholar
• Dial RB (2006) A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Res. Part B: Methodological 40(10):917–936.Crossref, Google Scholar
• Engelson L, Lindberg PO (2006) Congestion pricing of road networks with users having different time values. Lawphongpanich S, Hearn DW, Smith MJ, eds. Mathematical and Computational Models for Congestion Charging (Springer, New York), 81–104.Crossref, Google Scholar
• Feng L, Xie J, Nie YM, Liu X (2020) Efficient algorithm for the traffic assignment problem with side constraints. Transportation Res. Rec. 2674(4):129–139.Crossref, Google Scholar
• Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res. Logist. Quart. 3(1–2):95–110.Crossref, Google Scholar
• Fukushima M (1984) A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transportation Res. Part B: Methodological 18(2):169–177.Crossref, Google Scholar
• Guo X, Yang H (2009) User heterogeneity and bi-criteria system optimum. Transportation Res. Part B: Methodological 43(4):379–390.Crossref, Google Scholar
• Huang H, Li Z (2007) A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS. Eur. J. Oper. Res. 176(3):1464–1477.Crossref, Google Scholar
• Jayakrishnan R, Wei TT, Prashker JN, Rajadhyaksha S (1994) A faster path-based algorithm for traffic assignment. Trans. Res. Record 1443:75–83.Google Scholar
• Lawphongpanich S, Hearn DW (1984) Simplical decomposition of the asymmetric traffic assignment problem. Transportation Res. Part B: Methodological 18(2):123–133.Crossref, Google Scholar
• Lee DH, Nie YM, Chen A, Leow YC (2002) Link-and path-based traffic assignment algorithms: Computational and statistical study. Transportation Res. Rec. 1783(1):80–88.Crossref, Google Scholar
• Leurent F (1993) Cost versus time equilibrium over a network. Eur. J. Oper. Res. 71(2):205–221.Crossref, Google Scholar
• Leurent F (1995) The practice of a dual criteria assignment model with continuously distributed values-of-time. Proc. 23rd Eur. Transport Forum (PTRC, London), 117–128.Google Scholar
• Leurent F (1996) The theory and practice of a dual criteria assignment model with a continuously distributed value-of-time. Lesort JB, ed. Proc. Internat. Sympos. Transportation Traffic Theory (Pergamon, Exeter, UK), 455–477.Google Scholar
• Leurent F, Coulombel N, Poulhès A (2012) A disaggregate residential equilibrium assignment model. Proc. Soc. Behav. Sci. 54:758–771.Crossref, Google Scholar
• Li WV, Kockelman KM, Huang Y (2021) Traffic and welfare impacts of credit-based congestion pricing applications: An Austin case study. Transportation Res. Rec. 2675(1):10–24.Crossref, Google Scholar
• Li Y, Liu Y, Xie J (2020) A path-based equilibrium model for ridesharing matching. Transportation Res. Part B: Methodological 138:373–405.Crossref, Google Scholar
• Light T (2009) Optimal highway design and user welfare under value pricing. J. Urban Econom. 66(2):116–124.Crossref, Google Scholar
• Liu Y, Nie YM, Hall J (2015) A semi-analytical approach for solving the bottleneck model with general user heterogeneity. Transportation Res. Part B: Methodological 71:56–70.Crossref, Google Scholar
• Lo HK, Luo XW, Siu BWY (2006) Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion. Transportation Res. Part B: Methodological 40(9):792–806.Crossref, Google Scholar
• Lucas K, Van Wee B, Maat K (2016) A method to evaluate equitable accessibility: Combining ethical theories and accessibility-based approaches. Transportation (Amsterdam) 43(3):473–490.Google Scholar
• Marcotte P (1998) Reformulations of a bicriterion equilibrium model. Fukushima M, Qi L, eds. Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Kluwer Academic Publishers, Dordrecht), 269–291.Crossref, Google Scholar
• Marcotte P, Zhu D (1994) An efficient algorithm for a bicriterion traffic assignment problem. Bianco L, Toth P, eds. Advanced Methods in Transportation Analysis (Springer, Berlin), 63–73.Google Scholar
• Marcotte P, Zhu D (1997) Equilibria with infinitely many differentiated classes of customers. Ferris MC, Pang JS, eds. Complementarity and Variational Problems: State of Art (SIAM, Philadelphia, PA), 234–258.Google Scholar
• Marcotte P, Zhu D (2009) Existence and computation of optimal tolls in multiclass network equilibrium problems. Oper. Res. Lett. 37(3):211–214.Crossref, Google Scholar
• Marcotte P, Nguyen S, Tanguay K (1996) Implementation of an efficient algorithm for the multiclass traffic assignment problem. Lesort JB, ed. Proc. 13th Internat. Sympos. Transportation Traffic Theory (Pergamon, New York), 217–236.Google Scholar
• Martens K, Golub A, Robinson G (2012) A justice-theoretic approach to the distribution of transportation benefits: Implications for transportation planning practice in the united states. Transportation Res. Part A: Policy Practice 46(4):684–695.Crossref, Google Scholar
• Mayet J, Hansen M (2000) Congestion pricing with continuously distributed values of time. J. Transport Econom. Policy 34(3):359–369.Crossref, Google Scholar
• Meng Q, Liu Z, Wang S (2012) Optimal distance tolls under congestion pricing and continuously distributed value of time. Transportation Res. Part E: Logist. Transportation Rev. 48(5):937–957.Crossref, Google Scholar
• Monderer D, Shapley LS (1996) Potential games. Games Econom. Behav. 14(1):124–143.Crossref, Google Scholar
• Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problems. Eur. J. Oper. Res. 53(1):81–92.Crossref, Google Scholar
• Nagurney A (2000) A multiclass, multicriteria traffic network equilibrium model. Math. Comput. Modeling 32(3–4):393–411.Crossref, Google Scholar
• Nagurney A, Dong J (2002) A multiclass, multicriteria traffic network equilibrium model with elastic demand. Transportation Res. Part B: Methodological 36(5):445–469.Crossref, Google Scholar
• Nie YM (2006) A programmer’s manual for toolkit of network modeling (TNM). University of California, Davis.Google Scholar
• Nie YM (2010) A class of bush-based algorithms for the traffic assignment problem. Transportation Res. Part B: Methodological 44(1):73–89.Crossref, Google Scholar
• Nie YM (2011) Multi-class percentile user equilibrium with flow-dependent stochasticity. Transportation Res. Part B: Methodological 45(10):1641–1659.Crossref, Google Scholar
• Nie YM, Liu Y (2010) Existence of self-financing and pareto-improving congestion pricing: Impact of value of time distribution. Transportation Res. Part A: Policy Practice 44(1):39–51.Crossref, Google Scholar
• Nocedal J, Wright SJ (1999) Numerical Optimization (Springer, New York).Crossref, Google Scholar
• Pigou AC (1920) The Economics of Welfare (Palgrave Macmillan, London).Google Scholar
• Powell MJ (1978) A fast algorithm for nonlinearly constrained optimization calculations. Watson GA, ed. Numerical Analysis (Springer, Berlin), 144–157.Crossref, Google Scholar
• Quandt RE (1967) A probabilistic abstract mode model. Studies in Travel Demand VIII (Mathematica Inc., Princeton, NJ), 127–149.Google Scholar
• Schneider M (1968) Access and land development. Special Report 97, Highway Research Board, National Academy of Sciences, Washington, DC.Google Scholar
• Sheffi Y (1985) Urban Transportation Networks, vol. 6 (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Spitzer JJ (1977) A numerically stable and efficient technique for the maintenance of positive definiteness in the Hessian for Newton-type methods. J. Comput. Appl. Math. 3(2):105–108.Crossref, Google Scholar
• Tan Z, Yang H (2012) The impact of user heterogeneity on road franchising. Transportation Res. Part E: Logist. Transportation Rev. 48(5):958–975.Crossref, Google Scholar
• Van Wee B, Geurs K (2011) Discussing equity and social exclusion in accessibility evaluations. Eur. J. Transport Infrastructure Res. 11(4):350–367.Google Scholar
• Verhoef ET, Small KA (2004) Product differentiation on roads: Constrained congestion pricing with heterogeneous users. J. Transport Econom. Policy 38(1):127–156.Crossref, Google Scholar
• Vickrey WS (1969) Congestion theory and transport investment. Amer. Econom. Rev. 59(2):251–261.Google Scholar
• Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc. Institution Civil Engrg. 1(3):325–362.Crossref, Google Scholar
• Xie J, Nie YM (2019) A new algorithm for achieving proportionality in user equilibrium traffic assignment. Transportation Sci. 53(2):566–584.Link, Google Scholar
• Xie J, Nie YM, Liu X (2018) A greedy path-based algorithm for traffic assignment. Transportation Res. Rec. 2672(48):36–44.Crossref, Google Scholar
• Xu Z, Xie J, Liu X, Nie YM (2020) Hyperpath-based algorithms for the transit equilibrium assignment problem. Transportation Res. Part E: Logist. Transportation Rev. 143:102102.Crossref, Google Scholar
• Yang H, Huang H (2004) The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transportation Res. Part B: Methodological 38(1):1–15.Crossref, Google Scholar
• Yang H, Huang H (2005) Mathematical and Economic Theory of Road Pricing (Emerald Group Publishing, Bingley, UK).Crossref, Google Scholar