An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues

References

• Akamatsu T. (1998) . Some efficient algorithms for dynamic traffic equilibrium assignment. Department of Knowledge-based Information Engineering Research Report, TUT-KIE-9801, Toyohashi University of Technology, Toyohashi, Aichi, JapanGoogle Scholar
• Akamatsu T. A dynamic traffic assignment paradox. Transportation Res. (2000) 34B:515–531Crossref, Google Scholar
• Akamatsu T., Kuwahara M. Dynamic user equilibrium assignment on oversaturated road networks for a one-to-many/many-to-one OD pattern. JSCE J. Infrastructure Planning Management (1994) IV-23:21–30Google Scholar
• Akamatsu T., Oishi N. Some numerical results on the iterative algorithms for dynamic equilibrium assignment with a one-to-many/many-to-one OD pattern. Proc. Infrastructure Planning Res. (1997) 20:287–290Google Scholar
• Akamatsu T., Takamatsu N. Some efficient algorithms for dynamic user equilibrium assignment with a one-to-many/many-to-one OD pattern. Proc. Infrastructure Planning Res. (1996) 19:549–552Google Scholar
• Dembo R. S. A primal truncated Newton algorithm with application to large-scale nonlinear network optimization. Math. Programming Stud. (1987) 31:43–71Crossref, Google Scholar
• Dembo R. S., Tulowitzki U. Computing equilibria on large multicommodity networks: Application of truncated quadratic programming algorithms. Networks (1988) 18:273–284Crossref, Google Scholar
• Facchinei F., Soares J., Maugeri A., Giannessi F. Testing a new class of algorithms for nonlinear complimentarity problems. Variational Inequalities and Network Equilibrium Problems (1995) (Plenum Press)Google Scholar
• Fisher A. A special Newton-type optimization method. Optimization (1992) 24:269–284Crossref, Google Scholar
• Fukushima M. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Programming (1992) 53:99–110Crossref, Google Scholar
• Hearn D. W., Lawphongpanich S., Ventura J. A. Restricted simplicial decomposition: Computation and extensions. Math. Programming Stud. (1987) 31:99–118Crossref, Google Scholar
• Heydecker B. G., Addison J. D., Lesort J.-B. An exact expression of dynamic traffic equilibrium. Proc. 13th Internat. Sympos. on Transportation and Traffic Theory (1996) (Elsevier)359–383Google Scholar
• Kuwahara M., Akamatsu T. Dynamic equilibrium assignment with queues for a one-to-many OD pattern. Proc. 12th Internat. Sympos. on Transportation and Traffic Theory (1993) (Elsevier, Amsterdam) 185–204Google Scholar
• Kuwahara M., Akamatsu T. Decomposition of the dynamic assignments with queues: DUO and DUE. Transportation Res. (1997) 31:1–10Crossref, Google Scholar
• Kuwahara M., Akamatsu T. Dynamic user optimal assignment with physical queues for a many-to-many OD Pattern. Transportation Res. (2001) 35B:461–479Crossref, Google Scholar
• Larsson T., Patriksson M. Simplicial decomposition with dis-aggregated representation for the traffic assignment problem. Transportation Sci. (1992) 26:4–17Link, Google Scholar
• Larsson T., Patriksson M. A class of gap functions for variational inequalities. Math. Programming (1999) 64:53–79Crossref, Google Scholar
• Lawphongpanich S., Hearn D. W. Simplicial decomposition of the asymmetric traffic assignment problem. Transportation Res. (1984) 18:123–133Crossref, Google Scholar
• LeBlanc L. J., Helgason R. V., Boyce D. E. Improved efficiency of the Frank-Wolfe algorithms for convex network programs. Transportation Sci. (1985) 19:445–462Link, Google Scholar
• LeBlanc L. J., Morlok E. K., Pierskalla W. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Res. (1975) 9:309–318Crossref, Google Scholar
• Pang J-S., Gabric S. A. NE/SQP: A robust algorithm for solving non-smooth equations. Math. Programming (1993) 60:295–337Crossref, Google Scholar
• Patriksson M. Partial linearization methods in nonlinear programming. J. Optim. Theory App. (1993) 78:227–46Crossref, Google Scholar
• Patriksson M.The Traffic Assignment Problems—Models and Methods (1994) (VSP, Utrecht, The Netherlands) Google Scholar
• Ran B., Boyce D. E.Modeling Dynamic Transportation Network (1996) (Springer, Berlin) Crossref, Google Scholar
• Ran B., Hall R. W., Boyce D. E. A link-based variational inequality model for dynamic departure time/route choice. Transportation Res. (1996) 30B:31–46Crossref, Google Scholar
• Robinson S. M. Strongly regular generalized equations. Math. Oper. Res. (1980) 5:43–62Link, Google Scholar
• Smith M. J. A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks. Transportation Res. (1993) 27B:49–63Crossref, Google Scholar
• Wie B. W., Tobin R. L., Friesz T. L., Bernstein D. A discrete time nested cost operator approach to the dynamic network user equilibrium problem. Transportation Sci. (1995) 29:79–92Link, Google Scholar
• Wu J. H., Florian M., Morcotte P. A general descent framework for the monotone variational inequality problems. Math. Programming (1993) 61:281–300Crossref, Google Scholar