Dynamic user‐optimal departure time/route choice problem with time‐window

A discrete‐time predictive dynamic user‐optimal departure time/ route choice problem has been formulated and solved with the nested diagonalization method by Chen and Hsueh (1998a). That model did not impose constraints on either origin departure times or destination arrival times, which are typically required for regular work trips. For the purpose of better representing practical situations, the time‐window constraints associated with both departure times and arrival times are incorporated into the previous dynamic user‐optimal departure time/ route choice model, resulting in a dynamic user‐optimal departure time/ route choice model with time‐window, where the off‐peak and peak phenomena can be properly differentiated within the analysis period, and the influence of earlier departures on later arrivals with respect to perceived route disutilities can be appropriately modeled.