Abstract
In dynamic network loading and dynamic traffic assignment for networks, the link travel time is often taken as a function of the number of vehicles x(t) on the link at time t of entry to the link, that is, τ(t) = f(x(t)), which implies that the performance of the link is invariant (homogeneous) over time. Here we let this relationship vary over time, letting the travel time depend directly on the time of day, thus τ(t) = f(x(t), t). Various authors have investigated the properties of the previous (homogeneous) model, including conditions sufficient to ensure that it satisfies first-in-first-out (FIFO). Here we extend these results to the inhomogeneous model, and find that the new sufficient conditions have a natural interpretation. We find that the results derived by several previous authors continue to hold if we introduce one additional condition, namely that the rate of change of f(x(t), t) with respect to the second parameter has a certain (negative) lower bound. As a prelude, we discuss the equivalence of equations for flow propagation equations and for intertemporal conservation of flows, and argue that neither these equations nor the travel-time model are physically meaningful if FIFO is not satisfied. In §7 we provide some examples of time-dependent travel times and some numerical illustrations of when these will or will not adhere to FIFO.
Highlights
In dynamic network loading and dynamic traffic assignment for networks, the link travel time is often taken as a function of the number of vehicles x(t) on the link at time t of entry to the link, that is, τ(t) f (x(t)), which implies that the performance of the link is invariant over time
The travel time for each link in a network, in dynamic network loading (DNL) and dynamic traffic assignment (DTA), has often been modeled as a function of the number of vehicles x(t) on the link, f (x(t)), so that for a user entering a link at time t the link exit time is τ(t) t + f (x(t))
When this travel-time function is used to model traffic flows varying over time on a link it can violate a desirable first-in-first-out (FIFO) property
Summary
The travel time for each link in a network, in dynamic network loading (DNL) and dynamic traffic assignment (DTA), has often been modeled as a function of the number of vehicles x(t) on the link, f (x(t)), so that for a user entering a link at time t the link exit time is τ(t) t + f (x(t)). Where u(t) and v(t) are the inflow and outflow, respectively, at time t This model and its use in DNL and DTA has been investigated in many papers and is included in reviews such as Peeta and Ziliaskopoulos (2001), Szeto and Lo (2005, 2006), Friesz, Kwon, and Bernstein (2007), and Mun (2007, 2009). One thing that all of these methods have in common is that the time of day is automatically or available in the data collection process and in the resulting data sets This facilitates treating the time of day as a factor in estimating and predicting travel times and in estimating functions of the form f (x(t), t) used in (3).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
