|
|
Efective Logistic of Transport
Janovič, Jakub ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
This thesis considers with searching the shortest route depends on input conditions as number of vehicles and input map. Presents algorithms used for searching, their use in applications and their adjustment for existing problems. In this thesis is included whole scructure of the application as mentioned searching, its administration and administration of objects used in program.
|
|
|
Public transport route searching using moves afoot
Jiráček, Zbyněk ; Babilon, Robert (advisor) ; Foniok, Jan (referee)
Finding the fastest way between two given places is in recent hurried times quite useful thing. According to the complexity of traffic networks in larger cities a route searching engine becomes almost a necessity. Typical programs that focus on this problem usually do not pay attention to paths between individual stops and allow only movement in the scope of a single station. Many people, mostly those who do not know the area well enough, do not realize that in a city they can relatively quickly move by foot. Goal of this project is to design and implement a program which will be able to navigate user in the scope of a given city to a specified destination using means of public transport and walking. Instead of navigating only between stations, any place in map should be accepted.
|
|
|
Public transport route searching using moves afoot
Jiráček, Zbyněk ; Babilon, Robert (advisor) ; Foniok, Jan (referee)
Finding the fastest way between two given places is in recent hurried times quite useful thing. According to the complexity of traffic networks in larger cities a route searching engine becomes almost a necessity. Typical programs that focus on this problem usually do not pay attention to paths between individual stops and allow only movement in the scope of a single station. Many people, mostly those who do not know the area well enough, do not realize that in a city they can relatively quickly move by foot. Goal of this project is to design and implement a program which will be able to navigate user in the scope of a given city to a specified destination using means of public transport and walking. Instead of navigating only between stations, any place in map should be accepted.
|
|
|
Efective Logistic of Transport
Janovič, Jakub ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
This thesis considers with searching the shortest route depends on input conditions as number of vehicles and input map. Presents algorithms used for searching, their use in applications and their adjustment for existing problems. In this thesis is included whole scructure of the application as mentioned searching, its administration and administration of objects used in program.
|
guest ::
