@thesis{thesis,
		author={Djunaidi  Karina and HARYANTO  MUHAMMAD KURNIA and Kuswardani  Dwina},
		title ={APLIKASI PENENTUAN RUTE TERPENDEK DENGAN MENGGUNAKAN ALGORITMA DYNAMIC PROGRAMMING},
		year={2017},
		url={http://156.67.221.169/1740/},
		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.}
		}