Citation

Schneck A, Nökel K. Transp. Res. Rec. 2020; 2674(1): 188-196.

Copyright

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

DOI

10.1177/0361198119898455

PMID

unavailable

Abstract

In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O-D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques for the shortest path problem in road networks in the past decade. These techniques usually divide the problem into a relatively expensive preprocessing phase and a significantly accelerated search phase. In this paper, the recently developed customizable contraction hierarchies are used for both shortest path search and network loading in the bi-conjugate Frank-Wolfe algorithm. For the largest test network, this approach achieves a speedup by a factor of 42 compared with a straightforward implementation of Dijkstra's algorithm.

Language: en