Timebase dynamic weight for Dijkstra Algorithm implementation in route planning software

Lukman Rosyidi, Hening Pram Pradityo, Dedi Gunawan, Riri Fitri Sari

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of 2014 International Conference on Intelligent Green Building and Smart Grid, IGBSG 2014
PublisherIEEE Computer Society
ISBN (Print)9781467361231
DOIs
Publication statusPublished - 1 Jan 2014
Event1st International Conference on Intelligent Green Building and Smart Grid, IGBSG 2014 - Taipei, Taiwan, Province of China
Duration: 23 Apr 201425 Apr 2014

Publication series

NameProceedings of 2014 International Conference on Intelligent Green Building and Smart Grid, IGBSG 2014

Conference

Conference1st International Conference on Intelligent Green Building and Smart Grid, IGBSG 2014
Country/TerritoryTaiwan, Province of China
CityTaipei
Period23/04/1425/04/14

Keywords

  • dijkstra algorithm
  • route planning
  • shortest path
  • timebase base dynamic traffic

Fingerprint

Dive into the research topics of 'Timebase dynamic weight for Dijkstra Algorithm implementation in route planning software'. Together they form a unique fingerprint.

Cite this