Abstract
This paper is a follow-up study to the dynamic user-optimal departure time/route choice problem, by imposing hard time-windows on origin departure times and on destination arrival times. However, by an appropriate network representation, the dynamic user-optimal departure time/route choice problem with hard time-windows is mathematically equivalent to the dynamic user-optimal route choice problem and can be solved accordingly by the nested diagonalization method. The enhancements of the proposed model are that off-peak and peak phenomena within the analysis period can be properly differentiated and that the influence of earlier departures on latter ones can be naturally presented. A numerical example is provided for demonstration.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
