A day-to-day and within-day dynamic stochastic assignment model

In this article a doubly dynamis assignment model for a general network is presented. It is assumed that users' choices are based on information about travel times and generalized transportation costs occurred in a finite number of previous days and, possibly, in previous periods of the same day. The information may be supplied and managed by an informative system. In this context, path and link flows vary for different subperiods of the same day (within-day dynamics) and for different days (day-to-day dynamics). The proposed model follows a nonequilibrium approach in which both within-day and day-to-day flow fluctuations are modelled as a stochastic process. A model of dynamic network loading for computing within-day variable arc flows from path flows is also presented. The model deals explicitly with queuing at oversaturated intersections and can be formulated as a fixed point problem. A solution scheme for the doubly dynamic assignment model is presented embedding a solution algorithm for the fixed-point problem.