Map routing
| Thesis title in Czech: | Hledání tras v mapě |
|---|---|
| Thesis title in English: | Map routing |
| Key words: | směrovací algoritmy|preference|velké grafy |
| English key words: | routing algorithms|preferences|large graphs |
| Academic year of topic announcement: | 2020/2021 |
| Thesis type: | Bachelor's thesis |
| Thesis language: | angličtina |
| Department: | Department of Software Engineering (32-KSI) |
| Supervisor: | RNDr. Filip Zavoral, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 05.10.2020 |
| Date of assignment: | 05.10.2020 |
| Confirmed by Study dept. on: | 10.12.2020 |
| Date and time of defence: | 10.09.2021 09:00 |
| Date of electronic submission: | 22.07.2021 |
| Date of submission of printed version: | 22.07.2021 |
| Date of proceeded defence: | 10.09.2021 |
| Opponents: | Mgr. Adam Šmelko |
| Guidelines |
| 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. |
| References |
| 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. |