Determine the shortest route from BNNP-SU to KEJATISU using the dynamic programming method

Authors

  • Muhammad Ridwan Universitas Islam Negeri Sumatera Utara
  • Roshihan Mawazzi Lubis Universitas Islam Negeri Sumatera Utara
  • Zakaria Alfikri Sirait Universitas Islam Negeri Sumatera Utara
  • Machrani Adi Putri Siregar Universitas Islam Negeri Sumatera Utara

DOI:

https://doi.org/10.55537/jibm.v2i3.540

Keywords:

practical work, dynamic program, the shortest route

Abstract

Practical work (KP) is an academic activity aimed at ways of learning students to develop and improve a quality workforce. While the author was doing practical work at the National Narcotics Agency for North Sumatra Province (BNNP SUMUT), to deliver correspondence to the North Sumatra State High Court (KEJATISU) experienced delays in delivery. So the author provides input to find the shortest route using a dynamic program. Dynamic programming is the task of the solution method, dividing the solution into a set (phases). The research begins by determining the points to be traversed and finding the distance using Google maps. after obtaining it, the shortest path is sought using the dynamic program method and the shortest path obtained by the dynamic method is BNNP - Teladan Stadium - South Medan Samsat - North Sumatra High Court. Total value of 13.6 km

Downloads

Download data is not yet available.

References

Anggraini, J. (2012). Hukum Administrasi Negara. Yogyakarta : Graha Ilmu.

Arummi, A. (2015). Pengaruh Pemusnahan Barang Sitaan Narkotika Terhadap Kekuatan Barang Bukti di Persidangan. Jurnal Serambi Hukum. Vol 8. No 2 Agustus 2014-Januari 2015. ISSN : 1693-0819.

Hasibuan, J. B. (2019). Kedudukan Barang Bukti dalam Perkara Pidana Ditinjau Berdasarkan Kitab Undang-Undang Hukum Acara Pidana. Jurnal Ilmu Hukum. Vol 1. No 2.

Herman, Y. (2017). Tinjauan Yuridis Terhadap Pemusnahan Barang Bukti Narkotika Ditinjau dari Undang-Undang No. 35 Tahun 2009 Tentang Narkotika. Lex Privatum Vol. V/No. 2/ Mar-Apr/2017.

Jumadi. (2014). Penentuan Rute Terpendek Menuju Kampus Menggunakan Algoritma Dynamic Programing.vol VIII ISSN 1978-8911.

Munir, R. (2008). Program Dinamis, Bahan Kuliah Strategi Algoritma, Jurusan Teknik Informatika, Sekolah Informatika dan Elektro, Institut Teknologi Bandung.

Nurhidayati, F. U. (2010), Penggunaan Program Dinamik untuk Menentukan Total Biaya Minumum pada Perencanaan Produksi dan Pengendalian Persediaan, Skripsi, Jurusan Matematika, Fakultas Sains danTeknologi, Universitas Islam Negeri Maula Malik Ibrahim, Malang

Rizal, S. (2019). Mekanisme Penyimpanan dan Pemusnahan Benda Sitaan Narkotika. Aceh: UIN AR-RANIRY.

Published

2023-04-29

How to Cite

Ridwan, M., Lubis, R. M. ., Sirait, Z. A. ., & Siregar, M. A. P. (2023). Determine the shortest route from BNNP-SU to KEJATISU using the dynamic programming method. Jurnal IPTEK Bagi Masyarakat, 2(3), 127–133. https://doi.org/10.55537/jibm.v2i3.540

Issue

Section

Articles