A Literature review on finding the K Shortest Path using Dynamic Route Guidance Systems
The shortest path problem is one of the most fundamental problems applicable in various fields and has close relation to route navigation systems. This is actually quite an established technique for multi criteria optimization. A literature review on this technique with focus on transportation network would be quite helpful for any research related to dynamicRoute Guidance systems (RGS) Route guidance helps us in providing the path directions based on changing traffic conditions. Given a set of origin destination (O/D) pairs, there could be many possible routes for a driver. A useful routing system should have the capability to support the driver effectively in deciding on an optimum route to his preference. The algorithm is suitable for finding not only the shortest route but also better routes. The shortest travel time is estimated by applying various shortest path algorithms to the traffic network that has deterministic or dynamic link travel times. Because it is difficult to evaluate these shortest path finding algorithms in real traffic situations, most of them are evaluated in the virtual traffic networks. Index terms: Route guidance, Dijkstra Algorithm, Navigation, Fuzzy Neural network.