A Fast and Reliable Dijkstra Algorithm for Online Shortest Path

Iqbal, Mazhar; Zhang, Kun; Iqbal, Sami; Tariq, Irfan

doi:10.14445/23488387/ijcse-v5i12p106

Cited by 12 publications

(10 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is no doubt that smart routing would require real time data to be richer and more efficient. Real time information is the most efficient and reliable way to determine the least cost route, and it is consistent with [28] with regards to determining the fastest route. Highlighting one of the limitations of this research, the least cost path can only be efficiently determined using real time information.…”

Section: Discussionmentioning

confidence: 74%

“…It shows the flow of information in a smart city system where external sources associated with specific smart subsystems fetch and feed-in specific data, mobility and environmental data in the case of this study, to be processed into meaningful information and later combined at the level of the smart routing system to assign a route. Various algorithms such as Bellman-Ford algorithm, the Floyd-Warshall algorithm and the Dijkstra algorithm, among others, can be used for calculation of the least cost route [28]. In this work, the Dijkstra algorithm is used to compute the least cost path in a set of alternative paths [28].…”

Section: Smart Routing In An Integrated Smart Citymentioning

confidence: 99%

“…In this work, the Dijkstra algorithm is used to compute the least cost path in a set of alternative paths [28]. This algorithm was considered for this work because, in addition to being the most used in vehicle routing and other network connection protocol, it is easily implemented in a distributed way, and its results contain information on vertices of the entire network, not only vertices they are connected to [28,29]. Traffic problems are dynamic and can change rapidly.…”

Section: Smart Routing In An Integrated Smart Citymentioning

confidence: 99%

“…The Dijkstra algorithm cannot accept a multigraph (which is permitted to have multiple edges or parallel edges between the same end nodes). Without loss of generality, to solve Various algorithms such as Bellman-Ford algorithm, the Floyd-Warshall algorithm and the Dijkstra algorithm, among others, can be used for calculation of the least cost route [28]. In this work, the Dijkstra algorithm is used to compute the least cost path in a set of alternative paths [28].…”

Section: Smart Routing In An Integrated Smart Citymentioning

confidence: 99%

“…Without loss of generality, to solve Various algorithms such as Bellman-Ford algorithm, the Floyd-Warshall algorithm and the Dijkstra algorithm, among others, can be used for calculation of the least cost route [28]. In this work, the Dijkstra algorithm is used to compute the least cost path in a set of alternative paths [28]. This algorithm was considered for this work because, in addition to being the most used in vehicle routing and other network connection protocol, it is easily implemented in a distributed way, and its results contain information on vertices of the entire network, not only vertices they are connected to [28,29].…”

Section: Smart Routing In An Integrated Smart Citymentioning

confidence: 99%

See 4 more Smart Citations

Information Integration in a Smart City System—A Case Study on Air Pollution Removal by Green Infrastructure through a Vehicle Smart Routing System

et al. 2020

View full text Add to dashboard Cite

Over the past few years, the ‘‘smart city’’ concept has emerged as a new trend to answer challenging issues related to urban development. Transformation of a city system into a smart system is meant to improve the quality of life for its people and their way of living, its environment, economy, transport, and governance. Due to benefits associated with the concept of the smart city and associated implementation challenges, traditional city systems have been undergoing transformation into smart city systems. However, observed approaches of transformation presented disconnected and fragmented city systems that usually hamper the interaction of city subsystems with the efficient and environmentally friendly urban environment. This work emphasizes the systematic view of a city system and proposes a novel method of smart city system integration. The results of our study show that in a smart city environment, where ecosystem services are valorised, air pollution emitted by vehicles can be removed by taking into consideration information related to air pollution reduction. A case study is presented to demonstrate that, with an integrated system, information outputs on travel decisions are different and more valuable. The case study explores the operability of the system, its limitations, and potential future improvements.

show abstract

Section: Discussionmentioning

confidence: 74%

Section: Smart Routing In An Integrated Smart Citymentioning

confidence: 99%