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 .
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:385881 |
| Date | January 2018 |
| Creators | Sychra, Marek |
| Contributors | Krčmář, Radim, Křivka, Zbyněk |
| Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0018 seconds