Defining time dependent route in urban transportation

The shortest path problems are used widely such as operational research, artificial intelligence and computer science. In this study, the shortest path problem in literature were examined and time-dependent shortest path problem has been emphasized. Purpose of defining time-dependent shortest path is providing alternatives to reach user target point. In the application part of the study, a web application was developed with Java programming language and was implemented for Ankara. The application is trying to determine the time dependence of the shortest path that used in urban transportation resources by making the transfer. Defining time-dependent shortest path application is compared with similar applications and focused on its advantages. The solutions of the application are visualised by the help of Google Maps API.