On finding optimum commuting path in a road network: A computational approach for smart city traveling. Issue 2 (22nd November 2019)

• Record Type: Journal Article
• Authors: Halim, Zahid; Khan, Aqsa; Sulaiman, Muhammad; Anwar, Sajid; Nawaz, Muhammad
• Is Part Of: Transactions on emerging telecommunications technologies. Volume 33:Issue 2(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-11-22
• Subjects: Telecommunication -- Periodicals; 384.05
• DOI: 10.1002/ett.3786
• Languages: English
• ISSNs: 2161-5748

Abstract

Abstract: Commuting in big cities with heavy traffic is a real‐world task faced by many on a daily basis. Finding a suitable path for commuting in real‐life complex traffic networks is an important research problem with many applications. The existing work in this domain is based on the travel time and distance from source to destination. However, other than these two factors, there are many additional features that impact the overall travel time and its quality. Some of these additional features include environmental factors, road condition, and the traffic flow. The driving time can be minimized by selecting the most suitable path where there is less congestion and other travel related conditions are favorable. Commuting duration can increase even on the shortest path if there is congestion or the route is blocked. This work presents a mobile crowdsourcing‐based model to find suitable commuting path(s) by considering the factors that directly or indirectly influence the overall travel time. Experiment in this work refers the naturalistic driving study to select the travel related features. An algorithm is proposed to find the suitable path from the user provided source to the destination using crowdsourced data generated using mobile application. Unlike other algorithms, the proposed approach can address the network peculiarities where travel cost is not only based on the distance between the nodes but other indirect factors are also involved. This work extracts all possible paths from a source to the destination and then computes the travel cost in terms of distance and satellite factors across the paths. This proposal is evaluated on eight large real‐world road network data sets. A comparison is performed with four state‐of‐the‐art pathfinding methods. These include, Floyd‐Warshall algorithm, Bellman‐Ford algorithm, open shortest path first algorithm, and Dijkstra algorithm. Empirical analysis shows that the additional factors incorporated in the proposed mobile crowdsourcing model while finding a suitable path have a significant impact on the travel time. The results show better performance of the proposed model than its counterparts. Abstract : The proposed approach can address the network peculiarities where travel cost is not only based on the distance between the nodes but other indirect factors are also involved. This work extracts all possible paths from a source to the destination and then computes the travel cost in terms of distance and satellite factors across the paths. Empirical analysis shows that the additional factors incorporated in the proposed mobile crowdsourcing model while finding a suitable path have a significant impact on the travel time.