Perbandingan Algoritma Pewarnaan LDO, SDO, dan IDO pada Graf Pengaturan Lampu Lalu Lintas di Persimpangan Lima Kota Tua Ampenan

Abstract

Colouring point is one of the topics in Theory Graph, which is about colouring all the points on a graph so that the are no two neighbouring points have the same colour. One of the applications is in the traffic light system, which can helps in improving the effectiveness of traffic lights to prevent and overcome congestion problems. The main purpose of colouring point is to use minimum different colours to colour all the points on a graph. The minimum number of colours used is called Chromatic number. The fewer colours used, the more effective the solution. The number of colours in traffic light system shows the number of conditions to manage the traffic lights. There are many different algorithms of colouring points; three of them are LDO, SDO and IDO algorithm. In this paper, we will apply and compare these three algorithms to the graph of traffic lights in crossing five Kota Tua Ampenan. We choose this crossroads because this is one of the crowded crossroads in Mataram city, especially in the morning, working hours and evenings. Based on our research, for this case LDO and IDO algorithm are more effective than SDO algorithm.