A Dynamic Traffic Assignment Method Based on Connected Transportation System

This paper proposed a dynamic traffic assignment method based on the connected transportation system to express the time-varied traffic flows caused by uncertain traffic demand and supply in the real traffic network accurately. In dynamic traffic assignment, because of the cumulative volumes of successive time intervals, a route-based traffic assignment algorithm is used for dynamic traffic assignment in this paper. Besides, a novel shortest path algorithm based actual and artificial link is proposed for the time-expanded network that consists of two kinds of arcs: the actual arc and the artificial one. Then, a simple example is used to illustrate the performance of the proposed method. The computational results show that the novel shortest path algorithm based actual and artificial link could be applied in the time-expanded networks with two types of arcs, and the route-based assignment method could achieve optimal balance solutions under different demand modes.

[1]  Baozhen Yao,et al.  Prediction of Bus Travel Time Using Random Forests Based on Near Neighbors , 2018, Comput. Aided Civ. Infrastructure Eng..

[2]  Chen Chao,et al.  Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network , 2019 .

[3]  Bin Yu,et al.  k-Nearest Neighbor Model for Multiple-Time-Step Prediction of Short-Term Traffic Condition , 2016 .

[4]  Chao Chen,et al.  Short‐Term Traffic Speed Prediction for an Urban Corridor , 2017, Comput. Aided Civ. Infrastructure Eng..

[5]  Sangjin Han,et al.  A Route-Based Solution Algorithm for Dynamic User Equilibrium Assignments , 2007 .

[6]  Anthony Chen,et al.  A DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH TRAFFIC-FLOW RELATIONSHIPS , 1995 .

[7]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[8]  Hai-Jun Huang,et al.  Dynamic user optimal traffic assignment model for many to one travel demand , 1995 .

[9]  Masao Kuwahara,et al.  DYNAMIC USER EQUILIBRIUM ASSIGNMENT ON OVERSATURATED ROAD NETWORKS , 1994 .

[10]  Terry L. Friesz,et al.  The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time , 1994, Transp. Sci..

[11]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[12]  Michael Patriksson.  On the convergence of descent methods for monotone variational inequalities , 1994, Oper. Res. Lett..

[13]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

[14]  Seungjae Lee,et al.  Mathematical programming algorithms for equilibrium road traffic assignment , 1995 .

[15]  Hong Kam Lo,et al.  ARE THE OBJECTIVE AND SOLUTIONS OF DYNAMIC USER-EQUILIBRIUM MODELS ALWAYS CONSISTENT? , 1996 .

[16]  Ping Hu,et al.  Transit network design based on travel time reliability , 2014 .

[17]  Jon Bottom,et al.  Dynamic Traffic Assignment: A Primer , 2011 .

[18]  B Wie,et al.  DYNAMIC SYSTEM OPTIMAL TRAFFIC ASSIGNMENT ON CONGESTED MULTIDESTINATION NETWORKS , 1990 .

[19]  Yonglei Jiang,et al.  Hinterland patterns of China Railway (CR) express in China under the Belt and Road Initiative: A preliminary analysis , 2018, Transportation Research Part E: Logistics and Transportation Review.

[20]  Ramachandran Balakrishna,et al.  Off-line calibration of Dynamic Traffic Assignment models , 2006 .

[21]  Mike Smith,et al.  A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks , 1993 .

[22]  Masao Kuwahara,et al.  Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern , 1997 .

[23]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[24]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[25]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[26]  Donald W. Hearn,et al.  The gap function of a convex program , 1982, Operations Research Letters.

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

[28]  Markos Papageorgiou,et al.  Dynamic modeling, assignment, and route guidance in traffic networks , 1990 .

[29]  Takashi Akamatsu,et al.  Cyclic flows, Markov process and stochastic traffic assignment , 1996 .

[30]  Yixuan Li,et al.  Large-Scale Dynamic Traffic Assignment: Implementation Issues and Computational Analysis , 2004 .

[31]  Yunpeng Wang,et al.  A heuristic algorithm based on leaf photosynthate transport , 2018, Simul..

[32]  Zhong Zhou,et al.  The [alpha]-reliable Mean-Excess Traffic Equilibrium Model with Stochastic Travel Times , 2010 .

[33]  Chao Chen,et al.  Fresh seafood delivery routing problem using an improved ant colony optimization , 2019, Ann. Oper. Res..

[34]  Yunpeng Wang,et al.  Agent-Based Simulation Optimization Model for Road Surface Maintenance Scheme , 2019 .

[35]  Feng You,et al.  Study on Self-Tuning Tyre Friction Control for Developing Main-Servo Loop Integrated Chassis Control System , 2017, IEEE Access.

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

[37]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[38]  H. Chen,et al.  Dynamic Travel Choice Models: A Variational Inequality Approach , 1998 .

[39]  Tao Feng,et al.  Allocation method for transit lines considering the user equilibrium for operators , 2019, Transportation Research Part C: Emerging Technologies.

[40]  William H. K. Lam,et al.  A Reliability-Based Stochastic Traffic Assignment Model for Network with Multiple User Classes under Uncertainty in Demand , 2006 .

[41]  H Schittenhelm.  On the integration of an effective assignment algorithm with path and path-flow management in a combined trip distribution and traffic assignment algorithm , 1991 .

[42]  B Heydecker,et al.  CALCULATION OF DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENTS , 1999 .

[43]  Che-Fu Hsueh,et al.  A model and an algorithm for the dynamic user-optimal route choice problem , 1998 .

[44]  George L. Nemhauser,et al.  A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

[45]  B. Ran,et al.  A LINK-BASED VARIATIONAL INEQUALITY FORMULATION OF IDEAL DYNAMIC USER-OPTIMAL ROUTE CHOICE PROBLEM , 1996 .