An efficient algorithm for dynamic traffic equilibrium assignment with queues

Transportation Science

Volumn 35, Issue 4, 2001, Pages 389-404

  Akamatsu, Takashi ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; HIGHWAY TRAFFIC CONTROL; MATHEMATICAL MODELS; QUEUEING THEORY;

DYNAMIC TRAFFIC EQUILIBRIUM; HEURISTIC ALGORITHMS; LARGE SCALE NETWORKS;

MOTOR TRANSPORTATION;

EID: 0035520360     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.35.4.389.10435     Document Type: Article

References (29)

1. Some efficient algorithms for dynamic traffic equilibrium assignment
2. A dynamic traffic assignment paradox
3. Dynamic user equilibrium assignment on oversaturated road networks for a one-to-many/many-to-one OD pattern
4. Some numerical results on the iterative algorithms for dynamic equilibrium assignment with a one-to-many/many-to-one OD pattern
5. Some efficient algorithms for dynamic user equilibrium assignment with a one-to-many/many-to-one OD pattern
6. A primal truncated newton algorithm with application to large-scale nonlinear network optimization
7. Computing equilibria on large multicommodity networks: Application of truncated quadratic programming algorithms
8. Testing a new class of algorithms for nonlinear complimentarity problems
9. A special newton-type optimization method
10. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
11. Restricted simplicial decomposition: Computation and extensions
12. An exact expression of dynamic traffic equilibrium
13. Dynamic equilibrium assignment with queues for a one-to-many OD pattern
14. Decomposition of the dynamic assignments with queues: DUO and DUE
15. Dynamic user optimal assignment with physical queues for a many-to-many OD pattern
16. Simplicial decomposition with disaggregated representation for the traffic assignment problem
17. A class of gap functions for variational inequalities
18. Simplicial decomposition of the asymmetric traffic assignment problem
19. Improved efficiency of the Frank-Wolfe algorithms for convex network programs
20. An efficient approach to solving the road network equilibrium traffic assignment problem
21. NE/SQP: A robust algorithm for solving non-smooth equations
22. Partial linearization methods in nonlinear programming
23. A link-based variational inequality model for dynamic departure time/route choice
24. Strongly regular generalized equations
25. A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks
26. A discrete time nested cost operator approach to the dynamic network user equilibrium problem
27. A general descent framework for the monotone variational inequality problems