APLIKASI PENENTUAN RUTE TERPENDEK DENGAN MENGGUNAKAN ALGORITMA DYNAMIC PROGRAMMING
Total View This Week0
Total View This Week0
Institusion
Institut Teknologi Perusahaan Listrik Negara
Author
HARYANTO, MUHAMMAD KURNIA
Kuswardani, Dwina
Djunaidi, Karina
Kuswardani, Dwina
Djunaidi, Karina
Subject
Teknik Informatika
Datestamp
2019-12-12 07:31:44
Abstract :
Application discussions emphasize the distance of travel routes undertaken by the expedition company with determining the shortest route on the Sumatera Line route. This application is made for the calculation of Traveling Salesman Problem using Dynamic Programming algorithm with MATLAB calculation simulation. This writing in the writing stage using waterfall method. While in testing the interface using blackbox test method. From this writ it is found that the use of Dynamic Programming algorithm on the determination of delivery route has reduced the travel distance by ± 4.9% and travel time ± 13.2% compared to the use of standard delivery company?s route. That the determination of the route of the expedition journey on the Sumatra Line route is more optimal by using this application.
Application discussions emphasize the distance of travel routes undertaken by the expedition company with determining the shortest route on the Sumatera Line route. This application is made for the calculation of Traveling Salesman Problem using Dynamic Programming algorithm with MATLAB calculation simulation. This writing in the writing stage using waterfall method. While in testing the interface using blackbox test method. From this writ it is found that the use of Dynamic Programming algorithm on the determination of delivery route has reduced the travel distance by ± 4.9% and travel time ± 13.2% compared to the use of standard delivery company?s route. That the determination of the route of the expedition journey on the Sumatra Line route is more optimal by using this application.
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
