A model and an algorithm for the dynamic user-optimal route choice problem
This paper formulates a discrete-time, link-based dynamic user-optimal route choice problem using the variational inequality approach. The proposed model complies with the dynamic user-optimal equilibrium condition in which for each origin-destination pair, the actual travel time experienced by travelers departing during the same interval is equal and minimal. A nested diagonalization procedure is then proposed and demonstrated with a numerical example.
Volume (Year): 32 (1998)
Issue (Month): 3 (April)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Wie, Byung-Wook & Friesz, Terry L. & Tobin, Roger L., 1990. "Dynamic user optimal traffic assignment on congested multidestination networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 431-442, December.
- Carey, Malachy, 1992. "Nonconvexity of the dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 26(2), pages 127-133, April.
- Janson, Bruce N., 1991. "Dynamic traffic assignment for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 25(2-3), pages 143-161.
- Smith, M. J., 1993. "A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 27(1), pages 49-63, February.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:32:y:1998:i:3:p:219-234. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.