Abstract
The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.
| Original language | English |
|---|---|
| Pages (from-to) | 656-671 |
| Number of pages | 16 |
| Journal | Transportation Research. Part B: Methodological |
| Volume | 81 |
| DOIs | |
| Publication status | Published - 1 Nov 2015 |
Fingerprint
Keywords
- Activity-travel link/path disutility
- Dynamic activity-travel assignment
- Dynamic user equilibrium
- Multi-state supernetwork
Cite this
}
Dynamic activity-travel assignment in multi-state supernetworks. / Liu, Peng; Liao, Feixiong; Huang, Hai-Jun; Timmermans, Harry.
In: Transportation Research. Part B: Methodological, Vol. 81, 01.11.2015, p. 656-671.Research output: Contribution to journal › Article › Academic › peer-review
TY - JOUR
T1 - Dynamic activity-travel assignment in multi-state supernetworks
AU - Liu, Peng
AU - Liao, Feixiong
AU - Huang, Hai-Jun
AU - Timmermans, Harry
PY - 2015/11/1
Y1 - 2015/11/1
N2 - The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.
AB - The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.
KW - Activity-travel link/path disutility
KW - Dynamic activity-travel assignment
KW - Dynamic user equilibrium
KW - Multi-state supernetwork
UR - http://www.scopus.com/inward/record.url?scp=84947492060&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2015.08.006
DO - 10.1016/j.trb.2015.08.006
M3 - Article
AN - SCOPUS:84947492060
VL - 81
SP - 656
EP - 671
JO - Transportation Research. Part B: Methodological
JF - Transportation Research. Part B: Methodological
SN - 0191-2615
ER -