Estimating Path Travel Costs for Heterogeneous Users on Large-Scale Networks: Heuristic Approach to Integrated Activity-Based Model–Dynamic Traffic Assignment Models

Integrating activity-based models (ABMs) with simulation-based dynamic traffic assignment (DTA) have gained attention from transportation planning agencies seeking tools to address the arising planning challenges as well as transportation policies such as road pricing. Optimal paths with least generalized cost are needed to route travelers at the DTA level, while at the ABM level, only the least generalized cost information is needed (without fully specified paths). Thus, rerunning (executing) the least generalized cost path-finding algorithm at each iteration of ABM and DTA does not seem to be efficient, especially for large-scale networks. Furthermore, storing the dynamic travel cost skims for multiclass users as an alternative approach is not efficient either in regard to memory requirements. In this study, the aim was to estimate the least generalized cost so as to be used in destination and mode choice models at the ABM level. A heuristic approach was developed to use the simulated vehicle trajectories that were assigned to the optimal paths in the DTA level to estimate different cost measures, including distance, time, and monetary cost associated with the least generalized cost path for any given combination of the origin, destination, and departure time (ODT) and value of time. The proposed approximation method presented in this study used vehicle trajectories, aligned with the origin–destination direction and located in a specific boundary shaping an ellipse around the origin and destination zones at a certain time window, to estimate travel costs for the given ODT and user class. Numerical results for two real-world networks suggest the applicability of the method in large-scale networks in addition to its lower computational burden, including solution time and memory requirements, relative to other alternative approaches.

[1]  B. Carré.  An Algebra for Network Routing Problems , 1971 .

[2]  Haris N. Koutsopoulos,et al.  A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures , 1994, Transp. Sci..

[3]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[4]  I. Murthy,et al.  A parametric approach to solving bicriterion shortest path problems , 1991 .

[5]  B. Zwart,et al.  On the relationship between travel time and travel distance of commuters , 1999 .

[6]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[7]  Hani S. Mahmassani,et al.  An extension of labeling techniques for finding shortest path trees , 2009, Eur. J. Oper. Res..

[8]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[9]  David E. Boyce,et al.  Implementing parallel shortest path for parallel transportation applications , 2001, Parallel Comput..

[10]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[11]  Hani S. Mahmassani,et al.  Activity-Based Model with Dynamic Traffic Assignment and Consideration of Heterogeneous User Preferences and Reliability Valuation , 2015 .

[12]  Hani S. Mahmassani,et al.  Impacts of Correlations on Reliable Shortest Path Finding , 2013 .

[13]  George B. Dantzig,et al.  ALL SHORTEST ROUTES IN A GRAPH , 1966 .

[14]  Mark Bradley,et al.  Activity-Based Travel Demand Models: A Primer , 2014 .

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[17]  Khaled Abdelghany,et al.  Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach , 2016 .

[18]  Robert B. Dial,et al.  Bicriterion traffic assignment : Efficient algorithms plus examples , 1997 .

[19]  Antonino Vitetta,et al.  From single path to vehicle routing: The retailer delivery approach , 2010 .

[20]  Chung-Cheng Lu,et al.  Variable Toll Pricing and Heterogeneous Users: Model and Solution Algorithm for Bicriterion Dynamic Traffic Assignment Problem , 2006 .

[21]  Hani S. Mahmassani,et al.  Network-wide Time-dependent Link Travel Time Distributions with Temporal and Spatial Correlations , 2016 .

[22]  Matthieu de Lapparent,et al.  Euclidean distance versus travel time in business location: A probabilistic mixture of hurdle-Poisson models , 2015 .

[23]  Sze Chun Wong,et al.  Bottleneck model revisited: An activity-based perspective , 2014 .

[24]  H. Mahmassani,et al.  Toll Pricing and Heterogeneous Users , 2005 .

[25]  Satish V. Ukkusuri,et al.  Dynamic User Equilibrium Model for Combined Activity-Travel Choices Using Activity-Travel Supernetwork Representation , 2010 .

[26]  Yves Tabourier,et al.  All shortest distances in a graph. An improvement to Dantzig's inductive algorithm , 1973, Discret. Math..

[27]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[28]  Michael L. Fredman,et al.  New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[29]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[30]  William H. K. Lam,et al.  An activity-based time-dependent traffic assignment model , 2001 .

[31]  P. Combes,et al.  Transport costs: measures, determinants, and regional policy implications for France , 2005 .

[32]  Hani S. Mahmassani,et al.  Path Finding in Stochastic Time Varying Networks with Spatial and Temporal Correlations for Heterogeneous Travelers , 2016 .

[33]  Hani S. Mahmassani,et al.  Network performance under system optimal and user equilibrium dynamic assignments: Implications for , 1993 .

[34]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[35]  Hani S. Mahmassani,et al.  An evaluation tool for advanced traffic information and management systems in urban networks , 1994 .

[36]  Elise Miller-Hooks,et al.  Least possible time paths in stochastic, time-varying networks , 1998, Comput. Oper. Res..

[37]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[38]  Hani S. Mahmassani,et al.  Simulation-Based Method for Finding Minimum Travel Time Budget Paths in Stochastic Networks with Correlated Link Times , 2014 .

[39]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[40]  Hani S. Mahmassani,et al.  IN-VEHICLE INFORMATION SYSTEMS FOR NETWORK TRAFFIC CONTROL: A SIMULATION FRAMEWORK TO STUDY ALTERNATIVE GUIDANCE STRATEGIES , 1992 .

[41]  Hani S. Mahmassani,et al.  Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

[42]  Lili Du.  Fundamental problems in vehicular ad hoc networks: Connectivity, reachability, interference, broadcast capacity, and online routing algorithms , 2008 .

[43]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[44]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[45]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[46]  Pitu B. Mirchandani,et al.  Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..

[47]  Ali Zockaie,et al.  Dynamic network equilibrium for daily activity-trip chains of heterogeneous travelers: application to large-scale networks , 2016 .

[48]  Amy Z. Zeng,et al.  AN INTELLIGENT SOLUTION SYSTEM FOR A VEHICLE ROUTING PROBLEM IN URBAN DISTRIBUTION , 2007 .