An Application of Dijkstra’s Algorithm to Identify the Destination of Tourists: Case Study of Ubon Ratchathani Province

Abstract

This purpose of this research was to study the Dijkstra’s algorithm to find the shortest distance from the source of Mueang Ubon Ratchathani district to the destination of two attractions: Sirindhorn Wararam Phu Prao temple and Huai Luang Waterfall. Replacement point Tourist attractions and districts include: Wararam Phu Prao temple, Huai Luang Waterfall, Warin Chamrap District, Phibul Mangsahan District, Det Udom District, Sirindhorn District, Na Chaluai District, Khong Chiam district and defined edge instead distance between districts to districts and districts to tourist attractions. The algorithm consists of three steps: setting the distance to the point, choosing points with the best distance values and adjusting the distance values of the points. The results showed that using Dijkstra's algorithm to determine the shortest distance of travel from Mueang Ubon Ratchathani district to Sirindhorn Wararam Phu Prao temple and from Mueang Ubon Ratchathani district to Huai Luang Waterfall. There are two possible traffic routes, and the shortest distance can be found are 83 kilometers and 114 kilometers respectively, with routes being Mueang Ubon Ratchathani - Warin  Chamrap – Sirindhorn - Sirindhorn Wararam Phu Prao temple and Mueang Ubon Ratchathani - Warin  Chamrap – Det Udom - Na Chaluai - Huai Luang Waterfall, respectively. The Dijkstra’s algorithm with the current route search system have the shortest distance values similarly.