Static and time-dependent shortest path through an urban environment: Time-Dependent Shortest Path

Author

Alhoula, Wedad ; Hartley, Jeffrey

Author_Institution

Sch. of Sci. & Technol., Nottingham Trent Univ., Nottingham, UK

fYear

2014

fDate

27-29 Aug. 2014

Firstpage

1027

Lastpage

1029

Abstract

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.

Keywords

directed graphs; network theory (graphs); public transport; road traffic; Dijkstra algorithm; accidents; directed graph; individualized dependable route information; k shortest path; pollution; public transportation; road traffic congestion; static dependent network; static dependent shortest path algorithm; time dependent network; time-dependent shortest path algorithm; traffic jams; urban environment; Algorithm design and analysis; Databases; Heuristic algorithms; Optimization; Roads; Shortest path problem; k shortest path; static network; time-dependent network;

fLanguage

English

Publisher

ieee

Conference_Titel

Science and Information Conference (SAI), 2014

Conference_Location

London

Print_ISBN

978-0-9893-1933-1

Type

conf

DOI

10.1109/SAI.2014.6918315

Filename

6918315