AN ALGORITHM TO DETERMINE OPTIMAL PATH FOR GIS BASED ROAD NETWORK
Traffic congestion is becoming a serious problem in modern cities across the globe. With the complex network of a modern city, finding optimal path for road user is a challenging task. Network analysis in Geographic Information Systems (GIS) provides strong decision support for users in searching sh...
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | Artykuł |
| Język: | angielski |
| Wydane: |
R&D Wing, MIST
2015
|
| Hasła przedmiotowe: | |
| Dostęp online: | http://hdl.handle.net/123456789/174 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|
| Streszczenie: | Traffic congestion is becoming a serious problem in modern cities across the globe. With the complex network of a modern city, finding optimal path for road user is a challenging task. Network analysis in Geographic Information Systems (GIS) provides strong decision support for users in searching shortest route, which considers only a single network weight. Unlike other shortest path algorithm, the author developed an algorithm which could be extensively used for GIS based global position of transport network to determine optimal path. A network matrix were generated using adjacent nodes (vertices) and travel cost (travel time). Another turn matrix was generated using adjacent nodes of intersection to estimate intersection delay and turn control. The algorithm was implemented in C++ environment. |
|---|