A dynamic network loading process with explicit delay modelling

In this paper, a neural network (NN) approximator, integrated to a dynamic network loading (DNL) process, is utilized to model delays and to solve the DNL problem at an unsignalized highway node. First, a dynamic node model (DNM) is set out to compute the time-varying traffic flows conflicting at the node. The presented DNM has two components: a link model set with a linear travel time function and an algorithm written with a set of node rules considering the constraints of conservation, flow splitting rates and non-negativity. Each of the selected NN methods, feed-forward back-propagation NN, radial basis function NN, and generalized regression NN, are utilized one by one in the NN approximator that is integrated with the proposed DNM, and, hence, three DNL processes are simulated. Delays forming as a result of capacity constraint and flow conflicting at the node are calculated with selected NN configurations after calibrating the NN component with conical delay function formulation. The results of the model structure, run solely with the conventional delay function, are then compared to evaluate the performance of the models supported with NNs relatively.

[1]  Heinz Spiess,et al.  Technical Note - Conical Volume-Delay Functions , 1990, Transp. Sci..

[2]  Xin Li,et al.  Limitations of the approximation capabilities of neural networks with one hidden layer , 1996, Adv. Comput. Math..

[3]  Timothy Masters,et al.  Practical neural network recipes in C , 1993 .

[4]  Dirk Heidemann,et al.  QUEUEING AT UNSIGNALIZED INTERSECTIONS , 1997 .

[5]  Jia Hao Wu,et al.  TWO IMPROVED NUMERICAL ALGORITHMS FOR THE CONTINUOUS DYNAMIC NETWORK LOADING PROBLEM , 2003 .

[6]  David E. Boyce,et al.  Generating Highway Travel Times with a Large-Scale, Asymmetric User Equilibrium Assignment Model , 1996 .

[7]  Tomaso A. Poggio,et al.  Extensions of a Theory of Networks for Approximation and Learning , 1990, NIPS.

[8]  E. Nadaraya.  On Non-Parametric Estimates of Density Functions and Regression Curves , 1965 .

[9]  H. Mhaskar,et al.  Neural networks for localized approximation , 1994 .

[10]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[11]  Uwe Hartmann,et al.  Mapping neural network derived from the parzen window estimator , 1992, Neural Networks.

[12]  Paolo Toth,et al.  Advanced Methods in Transportation Analysis , 1997 .

[13]  Michel Bierlaire,et al.  DynaMIT: a simulation-based system for traffic prediction and guidance generation , 1998 .

[14]  J. Ho.  A Successive Linear Optimization Approach to the Dynamic Traffic Assignment Problem , 1980 .

[15]  Malachy Carey.  Extending and solving a multiperiod congested network flow model , 1990, Comput. Oper. Res..

[16]  S. Y. Yun,et al.  A Performance evaluation of neural network models in traffic volume forecasting , 1998 .

[17]  Stephen G. Ritchie,et al.  Macroscopic Modeling of Freeway Traffic Using an Artificial Neural Network , 1997 .

[18]  Dipti Srinivasan,et al.  Neural Networks for Real-Time Traffic Signal Control , 2006, IEEE Transactions on Intelligent Transportation Systems.

[19]  Hilmi Berk Celikoglu,et al.  Application of radial basis function and generalized regression neural networks in non-linear utility function specification for travel mode choice modelling , 2006, Math. Comput. Model..

[20]  Hojjat Adeli,et al.  Freeway Work Zone Traffic Delay and Cost Optimization Model , 2003 .

[21]  Uwe Helmke,et al.  Existence and uniqueness results for neural network approximations , 1995, IEEE Trans. Neural Networks.

[22]  Mark Dougherty,et al.  A REVIEW OF NEURAL NETWORKS APPLIED TO TRANSPORT , 1995 .

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

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

[25]  Allan Pinkus,et al.  Multilayer Feedforward Networks with a Non-Polynomial Activation Function Can Approximate Any Function , 1991, Neural Networks.

[26]  Vittorio Astarita,et al.  Flow Propagation Description in Dynamic Network Loading Models , 1996 .

[27]  Malachy Carey,et al.  A Whole-Link Travel-Time Model with Desirable Properties , 2003, Transp. Sci..

[28]  Michael J Demetsky,et al.  SHORT-TERM TRAFFIC FLOW PREDICTION: NEURAL NETWORK APPROACH , 1994 .

[29]  Terry L. Friesz,et al.  A COMPARISON OF SYSTEM OPTIMUM AND USER EQUILIBRIUM DYNAMIC TRAFFIC ASSIGNMENTS WITH SCHEDULE DELAYS , 1995 .

[30]  Michael Florian,et al.  The continuous dynamic network loading problem : A mathematical formulation and solution method , 1998 .

[31]  J H Wu,et al.  MODELLING THE SPILL-BACK OF CONGESTION IN LINK BASED DYNAMIC NETWORK LOADING MODELS: A SIMULATION MODEL WITH APPLICATION , 1999 .

[32]  Carlos F. Daganzo,et al.  TRANSPORTATION AND TRAFFIC THEORY , 1993 .

[33]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[34]  David Branston,et al.  LINK CAPACITY FUNCTIONS: A REVIEW , 1976 .

[35]  Dominic Maratukulam,et al.  ANNSTLF-a neural-network-based electric load forecasting system , 1997, IEEE Trans. Neural Networks.

[36]  Mascha C. van der Voort,et al.  Combining kohonen maps with arima time series models to forecast traffic flow , 1996 .

[37]  Kenneth Levenberg.  A METHOD FOR THE SOLUTION OF CERTAIN NON – LINEAR PROBLEMS IN LEAST SQUARES , 1944 .

[38]  Claudio Meneguzzer,et al.  An equilibrium route choice model with explicit treatment of the effect of intersections , 1995 .

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

[40]  Malachy Carey,et al.  Nonconvexity of the dynamic traffic assignment problem , 1992 .

[41]  Kurt Hornik,et al.  Multilayer feedforward networks are universal approximators , 1989, Neural Networks.

[42]  G. S. Watson,et al.  Smooth regression analysis , 1964 .

[43]  D. Marquardt.  An Algorithm for Least-Squares Estimation of Nonlinear Parameters , 1963 .

[44]  Roger L. Tobin,et al.  Uniqueness and computation of an arc-based dynamic network user equilibrium formulation , 2002 .

[45]  Jooyoung Park,et al.  Universal Approximation Using Radial-Basis-Function Networks , 1991, Neural Computation.

[46]  H. Spiess.  CONICAL VOLUME-DELAY FUNCTIONS , 1990 .

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

[48]  Byung-Wook Wie.  A convex control model of dynamic system-optimal traffic assignment , 1997 .

[49]  Michel Pasquier,et al.  POP-TRAFFIC: a novel fuzzy neural approach to road traffic analysis and prediction , 2006, IEEE Transactions on Intelligent Transportation Systems.

[50]  Mark Dougherty,et al.  SHORT TERM INTER-URBAN TRAFFIC FORECASTS USING NEURAL NETWORKS , 1997 .

[51]  Y. W. Xu,et al.  Advances in the Continuous Dynamic Network Loading Problem , 1996, Transp. Sci..

[52]  S. Travis Waller,et al.  An Internet-based geographic information system that integrates data, models and users for transportation applications , 2000 .

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

[54]  Susan Grant-Muller,et al.  Use of sequential learning for short-term traffic flow forecasting , 2001 .

[55]  Vittorio Astarita,et al.  A CONTINUOUS TIME LINK MODEL FOR DYNAMIC NETWORK LOADING BASED ON TRAVEL TIME FUNCTION , 1996 .

[56]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[57]  E. Nadaraya.  On Estimating Regression , 1964 .

[58]  Donald F. Specht,et al.  A general regression neural network , 1991, IEEE Trans. Neural Networks.

[59]  Shing Chung Josh Wong,et al.  Urban traffic flow prediction using a fuzzy-neural approach , 2002 .

[60]  Patrice Marcotte,et al.  On the Existence of Solutions to the Dynamic User Equilibrium Problem , 2000, Transp. Sci..

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

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

[63]  Hai Yang,et al.  Analysis of the time-varying pricing of a bottleneck with elastic demand using optimal control theory , 1997 .

[64]  George Cybenko,et al.  Approximation by superpositions of a sigmoidal function , 1992, Math. Control. Signals Syst..

[65]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[66]  M. Stone.  Cross‐Validatory Choice and Assessment of Statistical Predictions , 1976 .

[67]  Bin Ran,et al.  Toward a class of link travel time functions for dynamic assignment models on signalized networks , 1997 .

[68]  B Ran,et al.  A FORMULATION AND SOLUTION ALGORITHM FOR A MULTI-CLASS DYNAMIC TRAFFIC ASSIGNMENT PROBLEM , 1996 .

[69]  Ismail Chabini.  Analytical Dynamic Network Loading Problem: Formulation, Solution Algorithms, and Computer Implementations , 2001 .

[70]  Bin Ran,et al.  A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models , 1993, Oper. Res..

[71]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[72]  Malachy Carey,et al.  A Constraint Qualification for a Dynamic Traffic Assignment Model , 1986, Transp. Sci..

[73]  Bin Ran,et al.  New Algorithm for a Multiclass Dynamic Traffic Assignment Model , 2002 .

[74]  Masao Kuwahara,et al.  Dynamic user optimal assignment with physical queues for a many-to-many OD pattern , 2001 .

[75]  Malachy Carey,et al.  Behaviour of a whole-link travel time model used in dynamic traffic assignment , 2002 .