Graph Model for Traffic Control in Surakarta

Authors

  • Rangga Noegraha a:1:{s:5:"en_US";s:21:"Universitas Pertamina";}
  • Tasmi Tasmi Universitas Pertamina
  • Haris Nur Kuncoro Universitas Pertamina
  • Ariana Yunita Universitas Pertamina

DOI:

https://doi.org/10.57102/jsis.v1i2.25

Keywords:

Dijkstra, graph, optimization, travel time, traffic

Abstract

Surakarta City is the most populous city in Central Java that has 64 traffic signals to regulate traffic. Drivers' travel time in Surakarta City is heavily influenced by the amount of time they spend waiting for their turn to move at each traffic signals they pass. A time setting for traffic signal changes needs to be designed to optimize each driver's travel time on several routes in Surakarta City. Once the traffic has been researched and modeled, a time setting can be created. This study shows a graph model that represent roadways in Surakarta. The Dijkstra algorithm was used in this study to optimize the routes represented in the graph by finding all the shortest routes between two traffic signals points.

Downloads

Published

2023-12-08

Issue

Section

Articles