Travel times in quasi-dynamic traffic assignment

More Info
expand_more

Abstract

By extending static traffic assignment with explicit capacity constraints, quasi-dynamic traffic assignment yields more realistic results while avoiding many disadvantages of dynamic assignment. We analyse the computation of travel times in quasi-dynamic assignment models. We formulate requirements for the correctness of resulting travel times, addressing both the calculation of travel times for individual routes and links itself, as well as the differences between travel times of different travel choices. We derive a new link travel time formula from vertical queuing theory that meets all requirements, unlike existing approaches in literature.