Timebase dynamic weight for Dijkstra Algorithm implementation in route planning software

This paper reviews Dijkstra Algorithm implementation in finding the shortest path for route planning. The regular shortest path algorithms do not consider the timebase dynamic traffic condition of road network, i.e the hourly changing of traffic density. Timebase dynamic weight for Dijkstra Algorith...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2014 International Conference on Intelligent Green Building and Smart Grid (IGBSG) S. 1 - 4
Hauptverfasser:	Rosyidi, Lukman, Pradityo, Hening Pram, Gunawan, Dedi, Sari, Riri Fitri
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.04.2014
Schlagworte:	Algorithm design and analysis Cities and towns dijkstra algorithm Graphical user interfaces Heuristic algorithms Roads route planning shortest path Software Software algorithms timebase base dynamic traffic
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!