SEARCHING ALGORITHMS IN A TRANSIT NETWORK OF A PUBLIC TRANSPORT AND THEIR IMPLEMENTATION IN GIS

V diplomskem delu smo raziskali in predstavili obstoječe pristope iskanja v omrežjih javnega potniškega prometa. Z analizo le-teh smo izdelali algoritem za določen model javnega potniškega omrežja, ki se uporablja v Republiki Sloveniji. Sprva smo izdelali algoritem z uporabo iskanja najkrajše poti. Opozorili smo na slabosti tega načina reševanja problema in razvili postopek za iskanje rešitev na obstoječem modelu potniškega omrežja, ki je podoben nekaterim obstoječim modernim rešitvam.Vse obstoječe in razvite postopke smo podrobneje opisali in primerjali rezultate. Ugotovili smo, da poskus pristopa z uporabo iskanja najkrajše poti ni primeren na obstoječem modelu, medtem ko naš pristop z vključenimi izboljšavami daje dobre rezultate in je primeren za uporabo v realnih sistemihIn this thesis, the existing approaches for path finding in public transit networks have been presented at first. After that, a search algorithm for a public transit network model used in Slovenia has been developed. The first approach is based on classical shortest path finding algorithms. Due its weaknesses, a new approach has been developed, which is comparable to other modern transit network algorithms. The existing algorithms and our approach have been described in details, and the obtained results have been compared. The proposed approach gives good results and is, therefore, suitable for the usage in real systems