Public transport route planning in the stochastic network based on the user individual preferences

Nowadays transport systems becomes more and more complex. Therefore, passengers have difficulty with route planning due to the variety of possible ways to get from the starting point to the destination one. Since the travel time often not considered as single and main criteria by passengers, it is important to take into account their own preferences which may be very different. In this paper, we proposed a stochastic route planning algorithm, which considers the user individual preferences. This method is based on the modified Dijkstra’s algorithm. The proposed algorithm is tested using real public transport dataset obtained from the transportation network of Samara, Russia.