Please use this identifier to cite or link to this item: https://repositori.uma.ac.id/handle/123456789/15867
Title: Penggunaan Algoritma Djikstra Dalam Menentukan Rute Tercepat Kampus UMA 2 Menuju Kampus UMA 1
Other Titles: Using the Djikstra Algorithm in Determining the Fastest Route from UMA 2 Campus to UMA 1 Campus
Authors: Sembiring, Aditya Pradipta
metadata.dc.contributor.advisor: Siregar, Syafiatun
Zuhanda, M Khahfi
Keywords: fastest route;djikstra algorithm;medan area university
Issue Date: 1-Apr-2021
Publisher: Universitas Medan Area
Series/Report no.: NPM;188110095
Abstract: UMA Campus 1 which is located on Jalan, H. Agus Salim Siregar and Campus 2 UMA which is located on Jalan Setia Budi have quite a distance. Both lecturers and students always leave quite a long time to move from campus 1 to campus 2. Some students attend lectures in the morning on campus 1 until 16.00, and in the afternoon on campus 2. Lectures on campus 2 start at 17.00 . Lecturers and students only have less than 1 hour if they want to move from campus 1 to campus 2. Choosing the fastest route is one of the alternatives in time efficiency. The topic of this Final Project Report is the calculation of travel time comparisons using the Djikstra Algorithm. From the results of calculations using the Djikstra Algorithm, two fastest routes were obtained, namely the route from Campus 1 UMA to Campus 2 UMA and the route from Campus 2 UMA to Campus 1 UMA.
Description: 72 Halaman
URI: https://repositori.uma.ac.id/handle/123456789/15867
Appears in Collections:SP - Mechanical Engineering

Files in This Item:
File Description SizeFormat 
188110095 - Aditya Pradipta Sembiring - Fulltext.pdfCover, Abstract, Chapter I,II,III, Bibliography2.28 MBAdobe PDFView/Open
188110095 - Aditya Pradipta Sembiring - Chapter IV.pdf
  Restricted Access
Chapter IV321.31 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.