Map routing
| Název práce v češtině: | Hledání tras v mapě |
|---|---|
| Název v anglickém jazyce: | Map routing |
| Klíčová slova: | směrovací algoritmy|preference|velké grafy |
| Klíčová slova anglicky: | routing algorithms|preferences|large graphs |
| Akademický rok vypsání: | 2020/2021 |
| Typ práce: | bakalářská práce |
| Jazyk práce: | angličtina |
| Ústav: | Katedra softwarového inženýrství (32-KSI) |
| Vedoucí / školitel: | RNDr. Filip Zavoral, Ph.D. |
| Řešitel: | skrytý - zadáno a potvrzeno stud. odd. |
| Datum přihlášení: | 05.10.2020 |
| Datum zadání: | 05.10.2020 |
| Datum potvrzení stud. oddělením: | 10.12.2020 |
| Datum a čas obhajoby: | 10.09.2021 09:00 |
| Datum odevzdání elektronické podoby: | 22.07.2021 |
| Datum odevzdání tištěné podoby: | 22.07.2021 |
| Datum proběhlé obhajoby: | 10.09.2021 |
| Oponenti: | Mgr. Adam Šmelko |
| Zásady pro vypracování |
| In order to have a nice biking experience, it is quite pleasant to plan a bike route in advance and then view it on a phone during biking. However, the mainstream software is incapable of finding bike paths that would meet biker's specific needs (e.g., preferred quality of terrain, maximum altitude, ...) or the functionality is fairly limited. The goal of the thesis is to modify and/or combine current routing algorithms to accommodate for such requirements. As a proof of the concept, the thesis should include a web application with fully functional map editor as well as a way for users to specify route requirements. Furthermore, it should be possible to export routes so that users could view them on their favorite mobile map applications. |
| Seznam odborné literatury |
| Abraham, Ittai & Fiat, Amos & Goldberg, Andrew & Werneck, Renato: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 782-793, 2010. R. Geisberger, P. Sanders, D. Schultes, and D. Delling: Contraction hierarchies: Faster and simpler hierarchi-cal routing in road networks. In WEA, pages 319–333, 2008. R. Gutman. Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In Proc. 6th International Workshop on Algorithm Engineering and Experiments, pages 100–111, 2004. |