A new Probabilistic Extension of Dijkstra’s Algorithm to simulate more realistic traffic flow in a smart city
作者：
Highlights：
• PEDA: a Probabilistic Extension of Dijkstra’s Algorithm is introduced.
• PEDA introduces probability distributions for assigning lengths and computing paths.
• In traffic flow, PEDA simulates that drivers do not have to know the optimal paths.
• The new ATISMART+ model for traffic simulations in a smart city is introduced.
• ATISMART+ produces more realistic simulations when using PEDA.
摘要
•PEDA: a Probabilistic Extension of Dijkstra’s Algorithm is introduced.•PEDA introduces probability distributions for assigning lengths and computing paths.•In traffic flow, PEDA simulates that drivers do not have to know the optimal paths.•The new ATISMART+ model for traffic simulations in a smart city is introduced.•ATISMART+ produces more realistic simulations when using PEDA.
论文关键词：Extension of Dijkstra’s Algorithm,Accelerated-time simulations,Smart cities,Probabilistic algorithms
论文评审过程：Available online 10 December 2014, Version of Record 20 September 2015.
论文官网地址：https://doi.org/10.1016/j.amc.2014.11.076
