Overview of nonlinear programming methods suitable for calibration of traffic flow models

The calibration of a macroscopic traffic flow model aims at enabling the model to reproduce, as accurately as possible, the real traffic conditions on a motorway network. Essentially, this procedure targets the best value for the parameter vector of the model and this can be achieved using appropriate optimization algorithms. The parameter calibration problem is formulated as a nonlinear, non-convex, least-squares optimization problem, which is known to attain multiple local minima; for this reason gradient-based solution algorithms are not considered to be an option. The methodologies that are more appropriate for application to this problem are mainly some meta-heuristic algorithms which use direct search approaches that allow them to avoid bad local minima. This paper presents an overview of the most suitable nonlinear programming methods for the calibration procedure of macroscopic traffic flow models. Furthermore, an application example, where two well-known macroscopic traffic flow models are evaluated through the calibration procedure, is presented.

[1]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL, PART II: NETWORK TRAFFIC , 1995 .

[2]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[3]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[4]  Serge P. Hoogendoorn,et al.  State-of-the-art of vehicular traffic flow modelling , 2001 .

[5]  Markos Papageorgiou,et al.  Macroscopic traffic flow model validation at congested freeway off-ramp areas , 2014 .

[6]  John H. Holland,et al.  Hidden Order: How Adaptation Builds Complexity , 1995 .

[7]  Markos Papageorgiou,et al.  METANET: A MACROSCOPIC SIMULATION PROGRAM FOR MOTORWAY NETWORKS , 1990 .

[8]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[9]  Dirk P. Kroese,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

[10]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[11]  Constantino Tsallis,et al.  Optimization by Simulated Annealing: Recent Progress , 1995 .

[12]  C. Daganzo A finite difference approximation of the kinematic wave model of traffic flow , 1995 .

[13]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[14]  M. Maher,et al.  Calibration of second order traffic models using continuous cross entropy method , 2012 .