Abstract
Existing dynamic user-equilibrium traffic assignment (DUETA) models are mostly expanded from the static user-equilibrium traffic assignment model by introducing the time dimension along with a group of additional constraints. Whereas the equivalency between the solution to the traffic assignment model and the user-equilibrium condition as defined by Wardrop is well established in the static case, the same may not be true for the dynamic case. This paper examines the general form of DUETA models as proposed in previous research and shows that, if queuing behavior is represented in the model at a minimal level, the solution to conventional DUETA models with an objective function of the form adopted by most existing formulations may not necessarily converge to or approximate the Wardropian user-equilibrium condition in the dynamic sense as defined by many researchers.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 137-144 |
| Number of pages | 8 |
| Journal | Transportation Research Part A: Policy and Practice |
| Volume | 34 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2000 |
| Externally published | Yes |
Fingerprint
Keywords
- Dynamic traffic assignment
- Mathematical programming
- Optimal control
- Traffic flow
- User equilibrium
ASJC Scopus subject areas
- Management Science and Operations Research
- Civil and Structural Engineering
- Transportation
Cite this
Are the objective and solutions of dynamic user-equilibrium models always consistent? / Lin, Wei Hua; Lo, Hong K.
In: Transportation Research Part A: Policy and Practice, Vol. 34, No. 2, 02.2000, p. 137-144.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Are the objective and solutions of dynamic user-equilibrium models always consistent?
AU - Lin, Wei Hua
AU - Lo, Hong K.
PY - 2000/2
Y1 - 2000/2
N2 - Existing dynamic user-equilibrium traffic assignment (DUETA) models are mostly expanded from the static user-equilibrium traffic assignment model by introducing the time dimension along with a group of additional constraints. Whereas the equivalency between the solution to the traffic assignment model and the user-equilibrium condition as defined by Wardrop is well established in the static case, the same may not be true for the dynamic case. This paper examines the general form of DUETA models as proposed in previous research and shows that, if queuing behavior is represented in the model at a minimal level, the solution to conventional DUETA models with an objective function of the form adopted by most existing formulations may not necessarily converge to or approximate the Wardropian user-equilibrium condition in the dynamic sense as defined by many researchers.
AB - Existing dynamic user-equilibrium traffic assignment (DUETA) models are mostly expanded from the static user-equilibrium traffic assignment model by introducing the time dimension along with a group of additional constraints. Whereas the equivalency between the solution to the traffic assignment model and the user-equilibrium condition as defined by Wardrop is well established in the static case, the same may not be true for the dynamic case. This paper examines the general form of DUETA models as proposed in previous research and shows that, if queuing behavior is represented in the model at a minimal level, the solution to conventional DUETA models with an objective function of the form adopted by most existing formulations may not necessarily converge to or approximate the Wardropian user-equilibrium condition in the dynamic sense as defined by many researchers.
KW - Dynamic traffic assignment
KW - Mathematical programming
KW - Optimal control
KW - Traffic flow
KW - User equilibrium
UR - http://www.scopus.com/inward/record.url?scp=0034006048&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034006048&partnerID=8YFLogxK
U2 - 10.1016/S0965-8564(98)00072-X
DO - 10.1016/S0965-8564(98)00072-X
M3 - Article
AN - SCOPUS:0034006048
VL - 34
SP - 137
EP - 144
JO - Transportation Research, Part A: Policy and Practice
JF - Transportation Research, Part A: Policy and Practice
SN - 0965-8564
IS - 2
ER -