A global optimization algorithm for trajectory data based car-following model calibration

How to calibrate the parameters of car-following models based on observed traffic data is a vital problem in traffic simulation. Usually, the core of calibration is cast into an optimization problem, in which the decision variables are car-following model parameters and the objective function usuall...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Transportation research. Part C, Emerging technologies Ročník 68; s. 311 - 332
Hlavní autoři: Li, Li, Chen, Xiqun (Micheal), Zhang, Lei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier India Pvt Ltd 01.07.2016
Témata:
Algorithms
Calibration
Computer simulation
Genetic algorithms
Global optimization
Lipschitz optimization
Mathematical models
Microscopic car-following model
Optimization
Searching
Trajectories
Global optimization
Lipschitz optimization
Calibration
Microscopic car-following model
ISSN:0968-090X, 1879-2359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:How to calibrate the parameters of car-following models based on observed traffic data is a vital problem in traffic simulation. Usually, the core of calibration is cast into an optimization problem, in which the decision variables are car-following model parameters and the objective function usually characterizes the difference between empirical vehicle movements and their simulated correspondences. Since the objective function is usually nonlinear and non-convex, various greedy or stochastic algorithms had been proposed during the last two decades. However, the performance of these algorithms remains to be further examined. In this paper, we revisit this important problem with a special focus on the geometric feature of the objective function. First, we prove that, from a global perspective, most existing objective functions are Lipschitz continuous. Second, we show that, from a local perspective, many of these objective functions are relatively flat around the global optimal solution. Based on these two features, we propose a new global optimization algorithm that integrates global direct search and local gradient search to find the optimal solution in an efficient manner. We compare this new algorithm with several existing algorithms, including Nelder–Mead (NM) algorithm, sequential quadratic programming (SQP) algorithm, genetic algorithm (GA), and simultaneous perturbation stochastic approximation (SPSA) algorithm, on NGSIM trajectory datasets. Results demonstrate that the proposed algorithm has a fast convergence speed and a high probability of finding the global optimal solution. Moreover, it has only two major configuration parameters that can be easily determined in practice.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0968-090X
1879-2359
DOI:10.1016/j.trc.2016.04.011