Faster Frank-Wolfe traffic assignment with new flow update scheme

Journal of Transportation Engineering

Volumn 128, Issue 1, 2002, Pages 31-39

  Chen, Anthony ^a   Jayakrishnan, R ^b   Tsai, Wei K ^c  

^a Utah State University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of California at Irvine   (United States)

Author keywords

Algorithm; Traffic assignment; Transportation planning

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; FLOW PATTERNS; ITERATIVE METHODS;

FLOW UPDATE SCHEME;

TRAFFIC CONTROL;

TRAFFIC MANAGEMENT;

EID: 0036147860     PISSN: 0733947X     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-947X(2002)128:1(31)     Document Type: Article

References (19)

1. The use of quantal loading in equilibrium traffic assignment
2. A full analytical implementation of the PARTAN/Frank-Wolfe algorithm for equilibrium assignment
3. Origin based network assignment
4. Projected Newton methods and optimization of multicommodity flows
5. Path and link flow based assignment algorithms: Finding and storing path-flow solutions and computational performance
6. An efficient implementation of the 'PARTAN' variant of the linear approximation method for the network equilibrium problem
7. A modified Frank-Wolfe algorithm for solving the traffic assignment problem
8. Finiteness in restricted simplicial decomposition
9. An extension of the Frank-Wolfe method of feasible directions
10. Simplicial decomposition with disaggregate representation for the traffic assignment problem
11. Improved efficiency of the Frank-Wolfe algorithm for convex network problems
12. An efficient approach to solving the road network equilibrium traffic assignment problem
13. Structure of the Model
14. A unified approach to equilibrium methods for traffic assignment
15. Accelerating convergence of the Frank-Wolfe algorithm