Accelerating strategies and computational studies of the Frank-Wolfe algorithm for the traffic assignment problem

Transportation Research Record

Volumn , Issue 1771, 2001, Pages 97-105

  Lee, Der Horng ^a   Nie, Yu ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; NONLINEAR PROGRAMMING; TRAFFIC CONTROL;

TRAFFIC ASSIGNMENT PROBLEM (TAP);

TRANSPORTATION;

EID: 0035731480     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1771-13     Document Type: Conference Paper

References (21)

1. Some theoretical aspects of road traffic research
2. An efficient approach to solving the road network equilibrium traffic assignment problem
3. An algorithm for quadratic programming
4. Convergence theory in nonlinear programming
5. The problem of cyclic flows in traffic assignment
6. Improved efficiency of the Frank-Wolfe algorithm for convex network problems
7. A modified Frank-Wolfe algorithm for solving the traffic assignment problem
8. Accelerating convergence of the Frank-Wolfe algorithm
9. Accelerated Frank-Wolfe algorithms
10. A finite algorithm to maximize certain pseudoconcave functions on polytopes
11. Finiteness in restricted simplicial decomposition
12. Dynamic user-optimal route choice modeling of a large-scale traffic network
13. Faster path-based algorithm for traffic assignment
14. Path-based algorithms for large-scale traffic equilibrium problems: Comparison between DSD and GP
15. Path and link based traffic assignment algorithms: A comprehensive computational study