Evaluating Path-Finding Algorithms for Real-Time Route Recommendation System Built using FreeRTOS

The severity of traffic congestion in Klang Valley, Malaysia, has recently worsened by the rising number of private automobiles and commercial vehicles. In this study, we developed a real-time route recommendation system using FreeRTOS and simulated an environment that included 44 shopping malls in Klang Valley. We evaluated the system using three shortest-path finding algorithms: the standard Dijkstra’s, Dijkstra’s with binary heap, and A*. The results indicated that the standard Dijkstra’s algorithm achieves the best performance as it can handle up to a million queries with an average response time of between 0.02 to 0.03 milliseconds per query. This research demonstrates the efficacy of the standard Dijkstra’s algorithm in processing massive amounts of user queries that fulfil the real-time requirements.