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

DOI10.1016/J.AMC.2014.11.076MaRDI QIDQ669785zbMATH OpenOpenAlexFDO

Authors José Luis Galán-García, Gabriel Aguilera-Venegas, 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

accelerated-time simulationsextension of Dijkstra's algorithmprobabilistic algorithmssmart cities

Mathematics Subject Classification ID

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

Recommendations

• A new approach to modeling of traffic flow in cities
• Improving the convergence of simulation-based dynamic traffic assignment methodologies
• Markov modeling of traffic flow in smart cities
• Urban traffic simulated from the dual representation: flow, crisis and congestion
• Application of a simulation-based dynamic traffic assignment model
• Application of a simulation-based dynamic traffic assignment model
• Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network

Cites work

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

Cited in

(6)

• Enhancing \textsc{Cas} improper integrals computations using extensions of the residue theorem
• A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path
• Optimizing Dijkstra algorithm design and accomplishment for parking routine programming based on weight caculation
• A discussion of the traffic jam problem in cities
• 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

Describes a project that uses

Uses Software

• ATISMART

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669785)