Claim Missing Document
Check
Articles

Found 1 Documents
Search

Menentukan Rute Terpendek dari BNNP-SU ke KEJATISU Menggunakan Metode Dynamic Programming Ridwan, Muhammad; Lubis, Roshihan Mawazzi; Sirait, Zakaria Alfikri; Siregar, Machrani Adi Putri
Jurnal IPTEK Bagi Masyarakat Vol 2 No 3 (2023)
Publisher : Ali Institute of Research and Publication

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55537/jibm.v2i3.540

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