Shortest Path Analysis of Tourist Routes in Sri Lanka Using Dijkstra’s Algorithm

Abstract

Sri Lanka's dispersed and varied tourist attractions necessitate optimal trip planning for travelers who want to visit more than one destination within time and budget limitations. This paper introduces an intelligent route planning scheme that employs Dijkstra's algorithm to calculate the most efficient and shortest routes of travel between chosen tourist destinations in Sri Lanka. By mapping attractions and highways as a weighted graph, the system calculates optimal routes to help visitors minimize travel time and transportation costs. For improved practical applicability, the solution may use real-world map data by consuming the Google Maps API for accurate distance computation and dynamic route optimization. The proposed approach facilitates smart tourism development by combining conventional graph algorithms with novel location based services and provides tourists with convenient, low-cost, and time-saving tours.

Description

Citation

Sangeeth, D.C.; Srimal, H.A.T.; Kumara, W.G.C.W. (2025) Shortest Path Analysis of Tourist Routes in Sri Lanka Using Dijkstra’s Algorithm, Technology Innovations & Digitalization Accompanying Creativity (TIDAC), NSBM Green University, Sri Lanka. P.331

Endorsement

Review

Supplemented By

Referenced By