Travel time computation of link and path flows and first-in-first-out

摘要: This paper outlines relationship between first-in-first-out (FIFO) and link (or path) travel time computing, by means of cumulative arrival and departure flows or curves, and implementation in dynamic traffic assignment (DTA) solving. First, it is noted that the assumption of link/path FIFO satisfaction underlies this method of computing travel times. Then, under assumption of aggregate link FIFO we set out expressions to ensure FIFO for each traffic type (destination type) on the link. We also set out how to maintain FIFO inside a cell while the cell-transmission recipe is employed to model time-varying traffic flows. The method presented is applicable to ordinary, diverge and merge cells and maintains FIFO on cells, links and paths.