The aim of this work was to write a java program that can read the data of OpenStreetMap and automatically finds the information to create the traffic network out of those data. As well, the program should be able to read other information from the data like attractions for shopping, working, leisure time acitivities and some more. With the given data, the program will calculate how much inhabitants are statistically living in every residential building.
The information that were read from the data, should be pointed to the closest traffic nodes. To do that, we tested several algorithms for example to find the shortest routes in the traffic network. In the end, we took the algorithm of Floyd and Warshall to find the shortest routes. With the given data, the traffic should be calculated with different methodes. After all the calculations, the traffic network and the traffic on the traffic network was visualized. The program was written so, that you can cut out an area of the OpenStreetMap data and the program will then do all the steps to calculate everything.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:29417 |
| Date | 21 April 2016 |
| Creators | Hantusch, Martin |
| Contributors | Treiber, Martin, Reinhold, Robert, Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | German |
| Detected Language | English |
| Type | doc-type:masterThesis, info:eu-repo/semantics/masterThesis, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0024 seconds