An efficient path-based algorithm for a dynamic user equilibrium problem

Huey Kuo Chen, Hsiao Chi Peng, Cheng Yi Chou

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


The trip distribution and traffic assignment (TDTA) problem characterizes travelers’ choice of route with the lowest travel impedance from trip origin to destination given (fixed and known) trip productions and trip attractions. This problem combines two submodels into a unified framework, namely, trip distribution and traffic assignment, which appear in the traditional four-stage transportation planning process. The combined model accrues no internal inconsistency between two modules. At equilibrium, the combined model must meet the total number of trips generated from origins and the total number of trips attracted to destinations and, in the meantime, comply with the travelers’ behavior of searching for the shortest path from trip origin to destination. To conserve the trips at both ends, a share model that preserves both the trip productions and trip attractions is needed. One of the most commonly used share formulas is based on the entropy maximization principle, which results in a joint entropy distribution/assignment model (JEDA).

Original languageEnglish
Title of host publicationUrban and Regional Transportation Modeling
Subtitle of host publicationEssays in Honor of David Boyce
PublisherEdward Elgar Publishing
Number of pages23
ISBN (Print)1843763060, 9781843763062
StatePublished - 2003


Dive into the research topics of 'An efficient path-based algorithm for a dynamic user equilibrium problem'. Together they form a unique fingerprint.

Cite this