EconPapers    
Economics at your fingertips  
 

A solution algorithm for a dynamic deterministic user equilibrium assignment model with departure time choice

Jin-Su Mun

Transportation Planning and Technology, 2011, vol. 34, issue 5, 443-466

Abstract: A route-based combined model of dynamic deterministic route and departure time choice and a solution method for many origin and destination pairs is proposed. The divided linear travel time model is used to calculate the link travel time and to describe the propagation of flow over time. For the calculation of route travel times, the predictive ideal route travel time concept is adopted. Solving the combined model of dynamic deterministic route and departure time choice is shown to be equivalent to solving simultaneously a system of non-linear equations. A Newton-type iterative scheme is proposed to solve this problem. The performance of the proposed solution method is demonstrated using a version of the Sioux Falls network. This shows that the proposed solution method produces good equilibrium solutions with reasonable computational cost.

Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2011.586115 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:transp:v:34:y:2011:i:5:p:443-466

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20

DOI: 10.1080/03081060.2011.586115

Access Statistics for this article

Transportation Planning and Technology is currently edited by Dr. David Gillingwater

More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:transp:v:34:y:2011:i:5:p:443-466