Record Details

Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method

Zeta - Math Journal

View Archive Info
 
 
Field Value
 
Title Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method
 
Creator Putra, Fani Darmawan
Rakhmawati, Fibri
Cipta, Hendra
 
Description ABSTRACT
The purpose of this research to arrange the route of the Medan public transportation system into a graph and find the closest route using a graph. The data used are data on travel routes and travel times public transportation for Terminal Pinang Baris to Terminal Amplas. The results obtained are Medan City Public Transport system  namely KPUM 64, RMC 120 and U-MORINA 138 can be represented in graph  with terminal as a vertex and the walk to connecting each terminal as edge. The calculation results using the nearest neighbor method and closed insertion method can produce different routes between KPUM 48, RMC 120 and U-MORINA 138 which have been operating now. Determining the shortest route by considering the shortest distance does not get jammed.
 
Keywords: Public Transportation, Routing Graph, Nearest Neighbor Method, Closed Insertion Method.
 
 
Publisher Universitas Islam Madura
 
Date 2021-08-16
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier https://journal.uim.ac.id/index.php/zeta/article/view/1082
10.31102/zeta.2021.6.2.6-10
 
Source Zeta - Math Journal; Vol 6 No 2 (2021): Juni 2021 - November 2021; 43-47
2579-5864
2459-9948
10.31102/zeta.v6i2
 
Language eng
 
Relation https://journal.uim.ac.id/index.php/zeta/article/view/1082/730
 
Rights Copyright (c) 2021 Fani Darmawan Putra, Fibri Rakhmawati, Hendra Cipta
http://creativecommons.org/licenses/by-sa/4.0