Dynamic capacitated user-optimal departure time/route choice problem with time-window

Dynamic capacitated user-optimal departure time/route choice problem with time-window

0.00 Avg rating0 Votes
Article ID: iaor20021834
Country: Netherlands
Volume: 132
Issue: 3
Start Page Number: 603
End Page Number: 618
Publication Date: Aug 2001
Journal: European Journal of Operational Research
Authors: , ,
Keywords: calculus of variations, vehicle routing & scheduling
Abstract:

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. That model did not impose constraints on either departure times at origin or arrival times at destination, which are typically required for regular work trips. However, for better representing practical situations, the time-window constraints associated with both the departure times and arrival times, along with link capacity side constraints, need to be incorporated into the aforementioned model. The resulting dynamic capacitated user-optimal departure time/route choice model with time-window can appropriately model the queuing delay associated with each capacitated time–space link and also can properly differentiate off-peak and peak phenomena within the analysis period. A numerical example is provided for demonstration.

Reviews

Required fields are marked *. Your email address will not be published.