Two Methods of Quasi-Optimal Routes Generation in Public Transportation Network

Traffic jams are a big problem in modern cities. Many people move from one place to another by public transport. They willingly use journey planners. Such systems enable users to find optimal routes, depending on their preferences, according to the minimal number of transfers or the minimal travel time. Generation of optimal routes with minimal number of transfers is not a difficult task. However, determination of routes with a minimal travel time is a much more complicated problem. This paper presents two original approximation methods for finding paths with a minimal travel time in a public transportation network. Author compares these methods, their execution time and the quality of approximation.