Static and Time-Dependent Shortest Path through an Urban Environment Time-Dependent Shortest Path

More and more problems occur with an increasing amount of transportation on the road. These problems include pollution, accidents and traffic congestion. Road traffic congestion is a significant problem in modern society. To avoid traffic jams we need to reduce the number of vehicles on the road by encouraging the use of public transportation. Travelers require individualized, dependable route information to be persuaded to use public transportation. This can be determined through the use of shortest path algorithms to determine the optimal routes for individuals. This paper aims to evaluate two k shortest path implementations (based on Dijkstra's algorithm (1959)) in a static and time dependent network.