Travel Route Optimization Using Dynamic Programming

Abstract

This paper provides research result in determining the optimal route sequence of destination and travel time on tourism buses with the same start-end point to improve tourism services and operational cost savings. The tourism bus service that will be discussed in this research is the tourism bus belonging to the Department of Culture and Tourism (Disbudpar) Surabaya, namely Surabaya Shopping and Culinary Track (SSCT) bus. SSCT bus currently has only two regular routes, namely Museum Track and Maritime Track, and will increase to several other routes type depends on annual tourism events in Surabaya. Unfortunately, in the calculation of this location is still manual so it allows some disadvantages, and if additional route type also still done manually, this mistake will happen repeatedly. Therefore, in this study the calculation of the optimal distance and travel time of SSCT bus will do in the basic formula of the Dynamic Programming method. The used main parameters are distance and time on road between tourist destinations, while traffic congestion as a limitations of the problem in this study. The final results of this study shows that time on road on the Museum Track and the Maritime Track can be saved up to 58% and 25% compared to the current manual time on road calculations. It certainly will help Disbudpar Surabaya in making the best decision in improving SSCT bus service.