|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
|
|
Searching and Updating Public Transport Timetables
Havel, Filip ; Zavoral, Filip (advisor) ; Škoda, Petr (referee)
Most of the people who use public transportation have specific areas of interests which can be used to cut down the transport network to several smaller parts. It is reasonable to assume that these people will want to be informed in case a change occurs in the restricted part of transport network they are interested in. For this reason, we created an application which informs its users about the changes in public transportation that concern them. We assume that for users, the most important area of interest are the connections between individual stations, which is why this thesis mainly focuses on the possibility of search for connection in timetables. In addition to this search, we also deal with the application's adaptability and we have implemented examples of expansions for various result outputs, user interfaces and data sources. To improve general user experience, we have developed a mobile application that communicates with the main application and displays updated timetables according to the user's area of interest. 1
|
|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
guest ::
