Uživatelsky orientovaná aplikace pro vyhledávání multimodálních spojení v pražské hromadné dopravě
| Název práce v češtině: | Uživatelsky orientovaná aplikace pro vyhledávání multimodálních spojení v pražské hromadné dopravě |
|---|---|
| Název v anglickém jazyce: | User-oriented application for multimodal public transit route search in Prague public transport network |
| Klíčová slova: | vyhledávání tras|otevřená data|mhd|multimodální doprava |
| Klíčová slova anglicky: | route search|open data|public transport|multimodal transit |
| Akademický rok vypsání: | 2023/2024 |
| Typ práce: | bakalářská práce |
| Jazyk práce: | |
| Ústav: | Katedra softwarového inženýrství (32-KSI) |
| Vedoucí / školitel: | doc. Mgr. Martin Nečaský, Ph.D. |
| Řešitel: | skrytý - zadáno a potvrzeno stud. odd. |
| Datum přihlášení: | 06.05.2024 |
| Datum zadání: | 12.05.2024 |
| Datum potvrzení stud. oddělením: | 12.05.2024 |
| Zásady pro vypracování |
| There are a few applications for public transit connection search both globally and in the Czech republic. However, as their aim is to be universal and accessible to the whole population of a country or potentially the world, their configuration options are usually very limited and they are not optimized for use in single specific cities. This universal design overlooks the fact that most users primarily seek guidance within a particular city along routes they already partially know, and thus can provide valuable input towards optimizing their travels and commutes in the city.
The objective of this bachelor thesis is to design and build a new application for multimodal travel planning in Prague, leveraging publicly accessible data. This application is intended to enhance travel comfort and flexibility in Prague by providing users with advanced options for customization and personalization of their travels according to their current needs. It will also include bikesharing in its route searching algorithm, to provide more transit options for the users. The application will use publicly available public transit and bikesharing data in the standardized GTFS and GBFS formats. |
| Seznam odborné literatury |
| [1] Delling, Daniel & Pajor, Thomas & Werneck, Renato. (2012). Round-Based Public Transit Routing. Transportation Science. 49. DOI: 10.1287/trsc.2014.0534.
[2] Delling, D., Sanders, P., Schultes, D., Wagner, D. (2009). Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds) Algorithmics of Large and Complex Networks. Lecture Notes in Computer Science, vol 5515. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-02094-0_7 [3] General Transit Feed Specification (GTFS) [online]. [cit. 2024-03-07] https://gtfs.org [4] General Bikeshare Feed Specification (GBFS) [online]. [cit. 2024-03-07] https://gbfs.org |