| dc.contributor |
|
|
| dc.contributor |
|
|
| dc.creator |
Abdallah, Yusuf Ibrahim |
|
| dc.creator |
Ramdani, Yani |
|
| dc.creator |
Permanasari, Yurika |
|
| dc.date |
2017-01-25 |
|
| dc.identifier |
http://karyailmiah.unisba.ac.id/index.php/matematika/article/view/6029 |
|
| dc.description |
The bus ride Trans Metro Bandung (TMB) corridor 1 and 2 can be formulated into the form of graphs to find the closest from a terminal to shelters that must be passed exactly once, and had to go back to the terminal of origin is a very important issue. It is an attempt to streamline the process within the transportation system. This trip bus transportation system could be modeled in a graph with symbols the point (Vertex)as ashelter and symbols the line (edge) as a line connect between the shelters. Routes TMB bus trip into the graph a closed path is called Cycle Hamilton. As for determining the shortest route from the TMB trip used two methods: Sequential Insertion and Nearest Neighbor. The results of route calculations and searches TMB corridor 1 and 2 yield different routes and distances from beginning of route and distance. Corridor 1 has the original route A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-A with a total distance of 44.4 km and the route alternative is A-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-A with a total distance of 42.95 km. Corridor 2 has the same beginning and alternatives is A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-A with the difference in a total distance is 28.4 km and 26.2 km because side F-G has two sides with a distance of 1 km and 2.2 km. |
|
| dc.description |
Perjalanan bus Trans Metro Bandung (TMB) koridor 1 dan 2 dapat diformulasikan ke dalam bentuk graf. Penentuan rute paling dekat dari sebuah terminal ke shelter-shelter yang harus dilewati tepat satu kali dan harus kembali ke terminal asal adalah persoalan yang sangat penting. Hal ini merupakan upaya untuk mengefisienkan jarak pada proses sistem transportasi. Sistem transportasi perjalanan bus yang dimodelkan dalam graf menggunakan simbol titik (Verteks) dan sebagai shelter dan simbol garis (edge) sebagai jalur yang menghubungkan antar shelter. Rute perjalanan bus TMB dalam graf tersebut merupakan lintasan tertutup dan disebut Cycle Hamilton. Penentuan rute terdekat dari perjalanan TMB tersebut digunakan dua metode yaitu: metode Sequential Insertion dan Tetangga Terdekat (Nearest Neighbor). Hasil perhitungan dan pencarian rute terpendek TMB koridor 1 dan 2 menghasilkan rute dan jarak yang berbeda dari rute dan jarak awal. Koridor 1 memiliki rute awal ialah A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-A dengan total jarak 44,4 km dan rute alternatifnya ialah A-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-A dengan total jarak 42,95 km. Koridor 2 memiliki rute awal dan alternatif yang sama yaitu A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-A dengan total jarak berbeda yaitu 28.4 km dan 26,2 km karena sisi F-G memiliki dua sisi dengan jarak 1 km dan 2,2 km. |
|
| dc.format |
application/pdf |
|
| dc.language |
ind |
|
| dc.publisher |
Universitas Islam Bandung |
|
| dc.relation |
http://karyailmiah.unisba.ac.id/index.php/matematika/article/view/6029/pdf |
|
| dc.rights |
Copyright (c) 2017 Prosiding Matematika |
|
| dc.source |
Prosiding Matematika; Vol 3, No 1, Prosiding Matematika (Februari, 2017); 36-41 |
|
| dc.source |
Prosiding Matematika; Vol 3, No 1, Prosiding Matematika (Februari, 2017); 36-41 |
|
| dc.source |
2460-6464 |
|
| dc.subject |
|
|
| dc.subject |
Graph Hamilton, Shortest Path, Sequential Insertion, Nearest Neighbor, Trans Metro Bandung. |
|
| dc.subject |
Matematika |
|
| dc.subject |
Graf Hamilton, Rute Terpendek, Sequential Insertion, Nearest Neighbor, Trans Metro Bandung |
|
| dc.title |
Hamilton Graph Application on the Shortest Path Routing Trans Metro Bandung |
|
| dc.title |
Aplikasi Graf Hamilton pada Penentuan Rute Terpendek Jalur Trans Metro Bandung |
|
| dc.type |
info:eu-repo/semantics/article |
|
| dc.type |
info:eu-repo/semantics/publishedVersion |
|
| dc.type |
Peer-reviewed Article |
|
| dc.type |
|
|
| dc.type |
Study Literature |
|