Citation

Jayakrishnan R, Tsai WK, Prashker JN, Rajadhyaksha S. Transp. Res. Rec. 1994; 1443: 75-83.

Copyright

(Copyright © 1994, Transportation Research Board, National Research Council, National Academy of Sciences USA, Publisher SAGE Publishing)

DOI

unavailable

PMID

unavailable

Abstract

A fresh look at the arguments against path-enumeration algorithms for the traffic assignment problem is taken, and the results of a gradient projection method are provided. The motivation behind the research is the orders of magnitude improvement in the availability of computer storage over the last decade. Faster assignment algorithms are necessary for real-time traffic assignment under several of the proposed advanced traffic management system strategies, and path-based solutions are preferred. The results show that gradient projection converges in one-tenth of the iterations of the conventional Frank-Wolfe algorithm. The computation time improvement is of the same order for small networks but is reduced as the network size increases. The computer implementation issues are discussed carefully, and schemes to achieve a 10-fold speedup for larger networks are also provided. The algorithm was used for networks of up to 2,000 nodes on a typical computer workstation, and certain data structures that save storage and solve the assignment problem for even a 5,000-node network are discussed.

Language: en

Keywords

Algorithms; Highway traffic control; Real time systems; Computer workstations; Convergence of numerical methods; Data storage equipment; Data structures