MATHEMATICA APPLICATION FOR GRAPH COLORING AT THE INTERSECTION OF JALAN PANGERAN ANTASARI JAKARTA

Suwarno Suwarno

doi:10.24127/ajpm.v6i2.945

Abstract

This research examines about graph coloring using Welch-Powell algorithm. This research begins by trying to understand about graph coloring and its algorithm. The case study was conducted at the intersection of Pangeran Antasari Street. In the formation of graph obtained 12 vertices as traffic flow and 16 edges as traffic path. The results of this study obtained 4 chromatic number s which describes 4 stages of traffic light arrangement. This paper also explains the application of Mathematica software in graph coloring.

Highlights

PRELIMINARY As a city entitled as the most populous city in the world, Jakarta has many problems
Abdul Majid Raya lit up along with the green light which is on Jl
Some of the scientific studies that have been done in overcoming traffic lights problems include setting traffic lights at the intersection of jalan Ahmad Yani Giant (Diana, Suryaningtyas, & Suprapti, 2016), Welch-Powell algorithm for traffic light control (Purnamasari, Ilman, & P, 2012), Graph coloring application Fuzzy to classify traffic lanes at the intersection of jalan Insinyur Soekarno Surabaya (Sulastri, Darmaji, & Irawan, 2014), and nodes coloring with Welch-Powell algorithm

Summary

Introduction

PRELIMINARY As a city entitled as the most populous city in the world, Jakarta has many problems. The traffic light setting is designed using Welch-Powell algorithm. Welch-Powell algorithm is one way of graph coloring to overcome scheduling problems. Welch-Powell algorithm is an algorithm used to color the vertices of a graph based on the highest degree of the vertices.

Results

Conclusion