The shortest path algorithm is the core problems in intelligent transportation system (ITS), especially for the large scale networks. The problem is classically solved by Dijkstra and Floyed algorithm ...

Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain constraints. In particular, ...