Claim Missing Document
Check
Articles

Found 1 Documents
Search

Optimalisasi Rute Perjalanan Menuju Kampus Universitas Duta Bangsa Surakarta Dengan Metode Dynamic Programming Adit Tri Wahyono; Damara Jibran Novianto; Tatang Andi Nugroho; Febrina Agusti
Journal Science Innovation and Technology (SINTECH) Vol. 4 No. 2 (2024): Vol. 4 No. 2 (2025): SINTECH JURNAL BULAN MEI 2024
Publisher : Universitas Duta Bangsa Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47701/sintech.v4i2.3924

Abstract

The Duta Bangsa Surakarta University campus is located on Jl. Ki Mangun Sarkoro Nusukan has become a destination for several people to work and study. Furthermore, the increasing population growth in the city of Surakarta and development developments in the city of Surakarta have also become a problem of traffic jams experienced by employees and students on their way to campus. The aim of this research is to determine the optimal distance or route from Bendosari to the Duta Bangsa Surakarta University campus which is located on Jl. Kimangun Sarkoro Nusukan. Dynamic Programming, or Dynamic Programming, is a method of solving problems by dividing the solution into a series of phases. The research results show that the shortest route to get to the Duta Bangsa Surakarta University campus which is located in Nusukan, is Bendosari, the Jamu Sukoharjo Statue, the Ir. Soekarno Solo Baru, Gemblegan Red Light, Singosaren, Pasar Legi, with a distance of 52.7 km.