Implementation of Dijkstra's algorithm to find an effective route to avoid traffic jam on a busy hour

Traffic Jam is a well-known thing that occurs in Indonesia, which caused by some factors, such as vehicle volume, narrow road, road user, activity on the road, and many more. Dijkstra's Algorithm is an algorithm that is commonly used in pathfinding to find a shortest path (Shortest Path Problem...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1116; číslo 2; s. 22042 - 22045
Hlavní autoři: Sembiring, P, Harahap, A S, Zalukhu, K S
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.12.2018
Témata:
Algorithms
Traffic congestion
Traffic jams
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Traffic Jam is a well-known thing that occurs in Indonesia, which caused by some factors, such as vehicle volume, narrow road, road user, activity on the road, and many more. Dijkstra's Algorithm is an algorithm that is commonly used in pathfinding to find a shortest path (Shortest Path Problem). Main focus on this research is to find an effective route to avoid the traffic jam points. This algorithm works to find the route to the final destination, finding the shortest route, and then to eliminate the route which qualified to the traffic jam. The result is an effective route, which is a route that has a possible shortest route and has no traffic jam points.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1116/2/022042