Dynamic network equilibrium for daily activity-trip chains of heterogeneous travelers: application to large-scale networks

Hooram Halat (), Ali Zockaie (), Hani S. Mahmassani (), Xiang Xu () and Omer Verbas ()
Additional contact information
Hooram Halat: Northwestern University
Ali Zockaie: Michigan State University
Hani S. Mahmassani: Northwestern University
Xiang Xu: Northwestern University
Omer Verbas: Northwestern University

Transportation, 2016, vol. 43, issue 6, No 6, 1059 pages

Abstract: Abstract Applications of dynamic network equilibrium models have, mostly, considered the unit of traffic demand either as one-way trip, or as multiple independent trips. However, individuals’ travel patterns typically follow a sequence of trips chained together. In this study we aim at developing a general simulation-based dynamic network equilibrium algorithm for assignment of activity-trip chain demand. The trip chain of each individual trip maker is defined by the departure time at origin, sequence of activity destination locations, including the location of their intermediate destinations and their final destination, and activity duration at each of the intermediate destinations. Spatial and temporal dependency of subsequent trips on each other necessitate time and memory consuming calculations and storage of node-to-node time-dependent least generalized cost path trees, which is not practical for very large metropolitan area networks. We first propose a reformulation of the trip-based demand gap function formulation for the variational inequality formulation of the Bi-criterion Dynamic User Equilibrium (BDUE) problem. Next, we propose a solution algorithm for solving the BDUE problem with daily chain of activity-trips. Implementation of the algorithm for very large networks circumvents the need to store memory-intensive node-to-node time-dependent shortest path trees by implementing a destination-based time-dependent least generalized cost path finding algorithm, while maintaining the spatial and temporal dependency of subsequent trips. Numerical results for a real-world large scale network suggest that recognizing the dependency of multiple trips of a chain, and maintaining the departure time consistency of subsequent trips provide sharper drops in gap values, hence, the convergence could be achieved faster (compared to when trips are considered independent of each other).

Keywords: Dynamic user equilibrium; activity-based model; Trip chains; Gap function; Convergence; Heterogeneity; Large-scale network applications; Mega-regional networks (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s11116-016-9724-4 Abstract (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:kap:transp:v:43:y:2016:i:6:d:10.1007_s11116-016-9724-4

Ordering information: This journal article can be ordered from
http://www.springer. ... ce/journal/11116/PS2

DOI: 10.1007/s11116-016-9724-4

Access Statistics for this article

Transportation is currently edited by Kay W. Axhausen

More articles in Transportation from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().