Dynamic User-Optimal Departure Time/Route Choice with Hard Time-Windows
Publication: Journal of Transportation Engineering
Volume 126, Issue 5
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.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Chen, H. K., and Hsueh, C. F. (1998a). “Discrete-time dynamic user-optimal departure time/route choice model.”J. Transp. Engrg., ASCE, 124(3), 246–254.
2.
Chen, H. K., and Hsueh, C. F. (1998b). “A model and an algorithm for the dynamic user-optimal route choice problem.” Transp. Res., 32B(3), 219–234.
3.
Chen, H. K. (1998). Dynamic travel choice models: A variational inequality approach, Springer, Berlin.
4.
Ran, B., and Boyce, D. (1996). Modeling dynamic transportation networks—An intelligent transportation system oriented approach, Springer, Berlin.
Information & Authors
Information
Published In
History
Received: Mar 12, 1998
Published online: Sep 1, 2000
Published in print: Sep 2000
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.