Print Email Facebook Twitter Travel times in quasi-dynamic traffic assignment Title Travel times in quasi-dynamic traffic assignment Author van der Gun, J.P.T. (TU Delft Transport and Planning) Pel, A.J. (TU Delft Transport and Planning) van Arem, B. (TU Delft Transport and Planning) Date 2019-09-11 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. Subject quasi-dynamic traffic assignmentlink travel timevertical queuing theorycapacity constraintlink performance function To reference this document use: http://resolver.tudelft.nl/uuid:4ace6f27-123b-4c99-a33f-6c8856dac83c Source hEART 2019: Budapest Event Symposium of the European Association for Research in Transportation, 2019-09-04 → 2019-09-06, Budapest Univesity of Technology and Economics, Budapest, Hungary Bibliographical note Accepted Author Manuscript Part of collection Institutional Repository Document type conference paper Rights © 2019 J.P.T. van der Gun, A.J. Pel, B. van Arem Files PDF hEART_2019_paper_74.pdf 572.11 KB Close viewer /islandora/object/uuid:4ace6f27-123b-4c99-a33f-6c8856dac83c/datastream/OBJ/view