Traffic simulation models calibration using speed–density relationship: An automated procedure based on genetic algorithm

Chiappone, Sandro; Giuffrè, Orazio; Granà, Anna; Mauro, Raffaele; Sferlazza, Antonino

doi:10.1016/j.eswa.2015.09.024

Cited by 40 publications

(17 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Owing to the stochastic nature of the cost functions related to the calibration process, the stochastic optimisation algorithms have been widely utilised to automatize this process. Therefore, many studies have attempted to identify various stochastic optimisation algorithms – such as GA [21, 22], simultaneous perturbation stochastic approximation (SPSA) [23, 24], simulated annealing [6, 25], Tabu search [26], memetic algorithm [27], and OptQuest [28] to solve the calibration problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Two‐fold calibration approach for microscopic traffic simulation models

Karimi

Alecsandru

2019

IET Intelligent Transport Systems

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

Two‐fold calibration approach for microscopic traffic simulation models

Karimi

Alecsandru

2019

IET Intelligent Transport Systems

View full text Add to dashboard Cite

“…extracted from video files using image-processing techniques [22][23][24]; (2) calibration of DBP using traffic flow measurement data (volume, speed, etc.) collected by detectors [6,25,26]. As we do not possess the capabilities for automatic image processing, we used the latter approach.…”

Section: Proposed Calibration Methodologymentioning

confidence: 99%

“…Various optimization methods have been employed to minimize the difference between the observed and simulated outputs. These include GA [6][7][8], SPSA [9], PSO [10], OQMS [4], and a combination/comparison of various of these [5,11]. The aforementioned studies show that GA is the optimization method most favoured by researchers because of its ease-of-implementation.…”

Section: Evolutionary Algorithmsmentioning

confidence: 99%

An Automatic Calibration Procedure of Driving Behaviour Parameters in the Presence of High Bus Volume

Dadashzadeh

Ergun

Kesten

et al. 2019

PROMET

View full text Add to dashboard Cite

Most of the microscopic traffic simulation programs used today incorporate car-following and lane-change models to simulate driving behaviour across a given area. The main goal of this study has been to develop an automatic calibration process for the parameters of driving behaviour models using metaheuristic algorithms. Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and a combination of GA and PSO (i.e. hybrid GAPSO and hybrid PSOGA) were used during the optimization stage. In order to verify our proposed methodology, a suitable study area with high bus volume on-ramp from the O-1 Highway in Istanbul has been modelled in VISSIM. Traffic data have been gathered through detectors. The calibration procedure has been coded using MATLAB and implemented via the VISSIM-MATLAB COM interface. Using the proposed methodology, the results of the calibrated model showed that hybrid GAPSO and hybrid PSOGA techniques outperformed the GA-only and PSO-only techniques during the calibration process. Thus, both are recommended for use in the calibration of microsimulation traffic models, rather than GA-only and PSO-only techniques.

show abstract

“…Pero, el tráfico dinámico hoy el Holding Time es menor al tiempo entre llegada de solicitudes, como consecuencia ocurre que existe una disponibilidad de la red siempre cambiante y dinámica. Este nuevo escenario no permite el uso de algoritmos convencionales dando espacio para el desarrollo de algoritmia heurística y metaheurística (Chiappone et al, 2016;Rodriguez et al, 2015;Pan et al, 2014;Assis, et al, 2010;Zang, et al, 2001). Los indicadores utilizados para evaluar los diferentes algoritmos son la Probabilidad de Bloqueo (PB), la Utilización de la red (UR) y la tasa de Algoritmia Heurística (TAH).…”

Section: Introductionunclassified

Estrategia Metaheurística para Redes Ópticas sin Conversión de Longitud de Onda con Tráfico Dinámico (WDM)

2016

View full text Add to dashboard Cite

ResumenLa presente investigación muestra la comparación entre diferentes heurísticas tales como Algoritmos genéticos, Simulated Annealing, Tabú Search, Snake-One y una nueva metaheurística Snake-Two. Anteriormente se obtuvieron bajos niveles de probabilidad de bloqueo con tendencia de aumento del uso de recursos. La estrategia Snake-Two demuestra que el comportamiento de la probabilidad de bloqueo disminuye a un costo bajo de utilización de la red. Estos resultados son comparados con un algoritmo convencional utilizado como referencia que permite visualizar la mejora en cada indicador. Los indicadores utilizados son la probabilidad de bloqueo y la utilización de la red y un nuevo indicador denominado Tasa de Algoritmo Heurístico. Esta estrategia propone utilizar enlaces congestionados hasta saturarlos permitiendo que el tráfico se concentre en algunas zonas y desdensifique otras. Los resultados son prometedores al lograr disminuir la probabilidad de bloqueo pero se mantiene la tendencia de aumento del uso de los recursos de la red. Palabras clave: recocido simulado; algortimos genéticos; modelo activo de contorno; snake one; snake twoAbstract This research shows the performance comparison between different heuristics such as genetic algorithms, simulated annealing, Tabu Search, Snake-One and a new metaheuristic called Snake-Two. Earlier were obtained low blocking probability but with a tendency to increase network utilization. The new Snake-Two strategy can prove that the behavior of the blocking probability decreases at low network usage. These results are compared with a conventional algorithm that was used to visualize the improvement of each indicator. The indicators used for comparison, are the blocking probability and the network utilization and a new indicator called Heuristic Algorithm Rate. This strategy proposes using the congested links, allowing increasing the traffic in some areas, and reducing it in other areas. The results are promising to achieve lower blocking probability but the tendency of increasing the use of the network resources continues.

show abstract

Traffic simulation models calibration using speed–density relationship: An automated procedure based on genetic algorithm

Cited by 40 publications

References 20 publications

Two‐fold calibration approach for microscopic traffic simulation models

Two‐fold calibration approach for microscopic traffic simulation models

An Automatic Calibration Procedure of Driving Behaviour Parameters in the Presence of High Bus Volume

Estrategia Metaheurística para Redes Ópticas sin Conversión de Longitud de Onda con Tráfico Dinámico (WDM)

Contact Info

Product

Resources

About