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...

Full description

Saved in:
Bibliographic Details
Main Authors: Rosyidi, Lukman, Pradityo, Hening Pram, Gunawan, Dedi, Sari, Riri Fitri
Format: Conference Proceeding
Language:English
Subjects:
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 Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 Algorithm compute the most efficient time and minimum fuel consumption based on the real condition of the traffic profiles of the road network. The traffic profiles describe the time needed to pass the road based on time which also differs for workdays and weekend. Simulation shows the implementation of Timebase Dynamic Weight for Dijkstra Algorithm can give better cost efficiency compared with the common Shortest Distance calculation and Traffic Avoidance calculation.
DOI:10.1109/IGBSG.2014.6835261