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...
Saved in:
| Published in: | 2014 International Conference on Intelligent Green Building and Smart Grid (IGBSG) pp. 1 - 4 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.04.2014
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!