Skripsi
IMPLEMENTASI PEWARNAAN GRAF DENGAN ALGORITMA WELCH-POWELL PADA LAMPU LALU LINTAS SIMPANG CHARITAS DAN SIMPANG POLDA PALEMBANG
Graph coloring is the process of coloring all vertices or sides or areas of a graph with different colors for each adjacent graph. In this study, the graph coloring process is implemented in the traffic light duration control at the Charitas and Polda intersections Palembang. The Charitas intersection and the Polda intersection are the Sumatra cross roads and are located in the center of Palembang city. The graph coloring steps are using the Welch-Powell algorithm, then determining the chromatic numbers and calculating the duration of new traffic lights. The new data on the duration of the traffic lights are then compared to the primary data. The results of calculations using the Welch-Powell Algorithm graph coloring show that the duration at the Charitas intersection is the same as the primary data, while at the Polda intersection the duration of the green light on each road is 64 seconds and the duration of the red light is 128 seconds. The implementation of graph coloring using the Welch-Powell algorithm at the traffic lights Charitas intersection does not provide changes to the result, while the traffic light control at the Polda intersection has a new alternative result.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2107003437 | T41159 | T411592021 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available