HENGKI HARIANTO, . (2016) APLIKASI PEWARNAAN GRAF MENGGUNAKAN ALGORITMA WELCH-POWELL PADA PENGATURAN TRAFFIC LIGHT. Sarjana thesis, UNIVERSITAS NEGERI JAKARTA.
![[img]](http://repository.unj.ac.id/style/images/fileicons/text.png) |
Text
Bismillah wisuda september 2016 .pdf Download (1MB) |
Abstract
Kemacetan lalu lintas merupakan masalah yang sering ditemukan di kota-kota besar di Indonesia. Hal ini memerlukan berbagai macam penyelesaian, salah satunya dengan pengaturan traffic light. Pengaturan traffic light dapat diselesaikan dengan teori graf. Bagian dari teori graf yang digunakan adalah pewarnaan graf. Pewarnaan graf dibedakan menjadi tiga yaitu pewarnaan simpul, pewarnaan sisi, dan pewarnaan wilayah (region). Skripsi ini mengkaji tentang penyelesaian pengaturan traffic light menggunakan pewarnaan simpul dengan algoritma Welch-Powell. Data persimpangan jalan yang direpresentasikan dalam graf, selanjutnya diselesaikan dengan pewarnaan simpul, kemudian mencari nilai efektifitas durasi waktu dibandingkan dengan pengaturan traffic light yang terjadi di persimpangan Matraman, Jakarta Timur. Tujuan penulisan skripsi ini, yaitu (1) Mengetahui bentuk model pewarnaan graf melalui hasil dari persimpangan jalan (2) Mengetahui tingkat efektifitas traffic light yang di lapangan. Metode penelitian yang digunakan meliputi pengumpulan data, pengolahan dan analisis data melalui representasi masalah ke graf higga mencari tingkat efektifitasnya. Melalui implementasi pewaranaan simpul menggunakan algoritma Welch-Powell ini diharapkan dapat memberikan sebuah solusi alternatif dalam penyelesaian kemacetan yang di persimpangan. Selain itu, juga dapat di terapkan pada persimpangan manapun yang memiliki waktu lampu total yang tidak sesuai dengan kondisi kendaran pada arus traffic light tersebut. Traffic jam is a problem that is often found in big cities in Indonesia. This problem requires many solutions, one of them with a traffic light settings. Traffic light settings can be solved by graph theory. Part of graph theory which is used by the coloring of a graph.Graph coloring is divided into three, such as vertex coloring, edge coloring, and region coloring. This thesis examines the solution of the traffic light settings using vertex coloring with Welch-Powell algorithm. Crossroads data represented in the graph, which is subsequently resolved by vertex coloring, then look for the value of the effective time duration is compared with the traffic light settings that occurs at the intersection of Matraman, East Jakarta. The purpose of this thesis, such as (1) Knowing the shape of graph coloring models through the results of the crossroads (2) Knowing the effectiveness of the traffic light in the field. The method which is used including data collection, processing and analysis of data through a graph representation to the problem and searching for their effectiveness. Through the implementation of vertex coloring using Welch-Powell algorithm is expected to provide an alternative solution of traffic jam at the intersection. In addition, it can also be applied at many intersection which has a total light time that is not appropriate with the current condition of the vehicle at the traffic light.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Additional Information: | 1) Drs. Mulyono, M. Kom 2) Med Irzal, M.Kom |
| Subjects: | Sains > Matematika |
| Divisions: | FMIPA > S1 Matematika |
| Depositing User: | sawung yudo |
| Date Deposited: | 06 Apr 2022 06:43 |
| Last Modified: | 06 Apr 2022 06:43 |
| URI: | http://repository.unj.ac.id/id/eprint/25917 |
Actions (login required)
 |
View Item |
