Publication at Faculty of Mathematics and Physics |
2009
Abstract
The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that speed up the given calculation.
The approach, when the calculation is not performed on the original network but on the simplified one, seems to be very promising. The path found in the simplified network can be easily mapped to a corresponding path in the original network.
In the case of the Prague public transport the simplified network has several times less nodes and the computation is speeded up correspondingly.