A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city

DOI10.1016/j.amc.2014.11.076zbMath1410.90041OpenAlexW2051093092MaRDI QIDQ669785

Gabriel Aguilera-Venegas, José Luis Galán-García, Pedro Rodríguez-Cielos, María Ángeles Galán-García

Publication date: 15 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.11.076

zbMATH Keywords

probabilistic algorithmsaccelerated-time simulationsextension of Dijkstra's algorithmsmart cities

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path ⋮ SODES: solving ordinary differential equations step by step ⋮ A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city ⋮ Enhancing \textsc{Cas} improper integrals computations using extensions of the residue theorem

Uses Software

• ATISMART

Cites Work

• A note on two problems in connexion with graphs
• Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
• A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city
• Towards a realistic microscopic description of highway traffic

This page was built for publication: A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city