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
Published in:2014 International Conference on Intelligent Green Building and Smart Grid (IGBSG) pp. 1 - 4
Main Authors: Rosyidi, Lukman, Pradityo, Hening Pram, Gunawan, Dedi, Sari, Riri Fitri
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2014
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:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Gunawan, Dedi
Pradityo, Hening Pram
Rosyidi, Lukman
Sari, Riri Fitri
Author_xml – sequence: 1
  givenname: Lukman
  surname: Rosyidi
  fullname: Rosyidi, Lukman
  email: lukman.rosyidi@ui.ac.id
  organization: Electr. Eng. Dept., Univ. Indonesia, Depok, Indonesia
– sequence: 2
  givenname: Hening Pram
  surname: Pradityo
  fullname: Pradityo, Hening Pram
  email: hening.pram@ui.ac.id
  organization: Electr. Eng. Dept., Univ. Indonesia, Depok, Indonesia
– sequence: 3
  givenname: Dedi
  surname: Gunawan
  fullname: Gunawan, Dedi
  email: dedi.gunawan31@ui.ac.id
  organization: Electr. Eng. Dept., Univ. Indonesia, Depok, Indonesia
– sequence: 4
  givenname: Riri Fitri
  surname: Sari
  fullname: Sari, Riri Fitri
  email: riri@ui.ac.id
  organization: Electr. Eng. Dept., Univ. Indonesia, Depok, Indonesia
BookMark eNotj0FLwzAYQCMoqLN_QC_5A5v58jVNe5zTzcHAgz14G2nztcts05JGxv69gju9w4MH755d-8ETY48gFgCieN5uXj43CykgXWQ5KpnBFUsKnUOaacxAItyyZJqOQgjQmQap79hX6XqqzETcnr3pXc1P5NpD5M0Q-Ks7fk8xGL7s2iG4eOi568eOevLRRDd47jwPw08kPnbGe-dbPg1NPJlAD-ymMd1EyYUzVq7fytX7fPex2a6Wu7krRJxLUmAUNQZUnVpRYd5goa1CWaHIhbVYA1FOqCtl0z_fSE05KLSVylKLOGNP_1lHRPsxuN6E8_6yj7-BKFPo
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IGBSG.2014.6835261
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
Accès Toulouse INP et ENVT - IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781467361231
1467361232
EndPage 4
ExternalDocumentID 6835261
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-2e51a5efa15c4d0b38f397d532b3080dd3c1ee8e37b5d40b3f27e8153db564d33
IEDL.DBID RIE
IngestDate Wed Aug 27 04:59:03 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-2e51a5efa15c4d0b38f397d532b3080dd3c1ee8e37b5d40b3f27e8153db564d33
PageCount 4
ParticipantIDs ieee_primary_6835261
PublicationCentury 2000
PublicationDate 2014-April
PublicationDateYYYYMMDD 2014-04-01
PublicationDate_xml – month: 04
  year: 2014
  text: 2014-April
PublicationDecade 2010
PublicationTitle 2014 International Conference on Intelligent Green Building and Smart Grid (IGBSG)
PublicationTitleAbbrev IGBSG
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001767127
Score 1.58892
Snippet This paper reviews Dijkstra Algorithm implementation in finding the shortest path for route planning. The regular shortest path algorithms do not consider the...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms 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
Title Timebase dynamic weight for Dijkstra Algorithm implementation in route planning software
URI https://ieeexplore.ieee.org/document/6835261
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9z-OCTyiZ-kwcf7dY2TdM8-rUpyBg4ZG8jH1etunZ0rfv3TdpuQ_DFt5AQQu7g7neXu_wQuqIx18IjzOGMxk6gI-pwGSoHfC255LEUFdfh6zMbjaLplI9b6HrTCwMAVfEZ9OywesvXmSptqqwfWrhgY50dxsK6V2ubT2Eh83y27otxef9pePsytMVbQa_Z-ItBpXIgg_3_HX2AuttOPDze-JhD1IK0g6YVGY9xP1jXfPJ4VSU4sQGg-D75-LTpC3zz9ZaZyP99jpP5ukjcagEnKc6zsgC8aAiL8NLY4pXIoYsmg4fJ3aPTMCQ4CXcLxwfqCQqx8KgKtCtJFBt4oSnxJTFIUGuiPIAICJNUB2Y99hlExsZpScNAE3KE2mmWwjHCTIVUGeigmP2QXXMRCGWwjAjNBSM3ZieoY4UyW9R_YMwaeZz-PX2G9qzc6wqXc9Qu8hIu0K76LpJlflkp7gcMOpxv
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9DBX1S2cRv8-Cj3domaZpHv_aBcwwcsreRr2rVtaPr3L9v0nYbgi--hYQQkoO7313u7gfANYmY4h6iDqMkcrAKicNEIB3tK8EEiwQvuA5f-3QwCMdjNqyBm3UtjNa6SD7TTTss_vJVKhc2VNYKLFywvs42wdh3y2qtTUSFBtTz6aoyxmWtXufupWPTt3Cz2vqLQ6UwIe39_x1-ABqbWjw4XFuZQ1DTSR2MCzoeY4CgKhnl4bIIcUIDQeFD_PFpAxjw9ustNb7_-xTG01WauJUDjBOYpYtcw1lFWQTnRhsveaYbYNR-HN13nYojwYmZmzu-Jh4nOuIekVi5AoWRARiKIF8ggwWVQtLTOtSICqKwWY98qkOj5ZQgAVYIHYGtJE30MYBUBkQa8CCpbcmuGMdcGjTDA3PB0I3oCajbR5nMyi4Yk-o9Tv-evgK73dFzf9LvDZ7OwJ6VQZnvcg628myhL8CO_M7jeXZZCPEHXVOftg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+International+Conference+on+Intelligent+Green+Building+and+Smart+Grid+%28IGBSG%29&rft.atitle=Timebase+dynamic+weight+for+Dijkstra+Algorithm+implementation+in+route+planning+software&rft.au=Rosyidi%2C+Lukman&rft.au=Pradityo%2C+Hening+Pram&rft.au=Gunawan%2C+Dedi&rft.au=Sari%2C+Riri+Fitri&rft.date=2014-04-01&rft.pub=IEEE&rft.spage=1&rft.epage=4&rft_id=info:doi/10.1109%2FIGBSG.2014.6835261&rft.externalDocID=6835261