A cell-based simultaneous route and departure time choice model with elastic demand
This paper develops a cell-based formulation for the simultaneous route and departure time choice problem with elastic demands through a variational inequality problem (VIP). This formulation follows the ideal Dynamic User Optimal (DUO) route and departure time choice principle and encapsulates a network version of the cell transmission model to improve the accuracy of dynamic traffic modeling. To solve the formulation, we adopt a descent method developed for co-coercive VIP. Two numerical studies are set up to demonstrate the quality of the solutions. The results show that the formulation correctly determines the DUO solution even in the presence of queue spillback and junction blockage. In the analysis, we prove that the origin-destination (OD) first-in-first-out (FIFO) property is only maintained under certain conditions of the travel time and schedule delay costs. These conditions on the cost parameters are, interestingly, consistent with the empirical results. Thus, the theoretical analyses together with the empirical results indicate that OD FIFO should hold in reality. This finding is a reasonable reflection of our experience, which shows that OD FIFO generally holds subject to overtaking not occurring commonly.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 38 (2004)
Issue (Month): 7 (August)
|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|
References listed on IDEAS
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.:
- Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
- Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
- Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
- Wie, Byung-Wook & Tobin, Roger L. & Carey, Malachy, 2002. "The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 897-918, December.
- Small, Kenneth A, 1982. "The Scheduling of Consumer Activities: Work Trips," American Economic Review, American Economic Association, vol. 72(3), pages 467-479, June.
- Yang, Hai & Meng, Qiang, 1998. "Departure time, route choice and congestion toll in a queuing network with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 247-260, May.
- Braid, Ralph M., 1989. "Uniform versus peak-load pricing of a bottleneck with elastic demand," Journal of Urban Economics, Elsevier, vol. 26(3), pages 320-327, November.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:38:y:2004:i:7:p:593-612. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.