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

Authors

  • Fani Darmawan Putra Universitas Islam Negeri Sumatera Utara Medan
  • Fibri Rakhmawati Universitas Islam Negeri Sumatera Utara Medan
  • Hendra Cipta Universitas Islam Negeri Sumatera Utara Medan

DOI:

https://doi.org/10.31102/zeta.2021.6.2.6-10

Keywords:

Public Transportation, Routing Graph, Nearest Neighbor Method, Closed Insertion Method

Abstract

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.

 

Downloads

Download data is not yet available.

References

Abrori, M. (2010). Uji Efisiensi Jalur Trans Jogja Trayek 3A. Sosio Religia.

Chatrand, L. et.al. (1986). Graphs and Digraphs Second Edition. California a Division of Wadsworth.

Febrian, D. (2019). Aplikasi Metode Tetangga (Nearest Neighbour Algorithm) Terdekat Untuk Mencari Rute Terpendek Perjalanan Wisata Museum Dan Wisata Religi Di Kota Medan. Jurnal Karismatika Unimed (pp. 1-13).

Hairulsyah. (2006). Kajian Tentang Transportasi di Kota Medan dan Permasalahannya. Jurnal Perencanaan Dan Pengembangan Wilayah Wahana Hijau.

Haryono. (2006). Pemilihan Model Transportasi Di DKI Jakarta Dengan Analisis Kebijakan Proses Hirarki Analitik. Jurnal Teknik Sipil Universitas Pelita Harapan.

Romelta, E. (2009). Metode Pencarian Lintasan Terpendek Dalam Graf. Bandung: ITB Press.

Roza, I., Narwen, Zulakmal. (2013). Graf Garis (Line Graph) Dari Graf Siklus, Graf Lengkap Dan Graf Bintang, Jurnal Matematika UNAND Fakultas Matematika Dan Ilmu Pengetahuan Alam, Universitas Andalas (pp. 1-4).

Wilson, R.J. and Watkin, J.J. (1990). Graph, An Introductory Approach. Sinagpore: John Wiley and Sons Inc.

Wirdasari, D. (2011). Teori Graf dan Implementasinya dalam Ilmu Komputer.. Jurnal Saintikom (pp. 23-34).

Downloads

Published

2021-08-16

How to Cite

Putra, F. D., Rakhmawati, F., & Cipta, H. (2021). Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method. Zeta - Math Journal, 6(2), 43–47. https://doi.org/10.31102/zeta.2021.6.2.6-10

Issue

Section

Articles

Most read articles by the same author(s)