Author(s): Kshitiz Bohara, Prativa Giri, Pravisan Bhandari, Sanyog Lamsal and Aayush Bhattarai

Abstract: This report deals with the shortest distance problem for the tourist to visit different places within Kathmandu valley exactly once and finally return to the starting place. The places can be chosen by the tourist himself/herself. This problem is based on the Travelling Sales-man Problem. This report gives a solution to find an optimum route for tourist using Evolu-tionary Algorithms (EA) technique to reduce the localization of the solution thereby giving more accurate result than the nonlinear approach. For the project, 49 different places were selected and by using the user defined function in google script, the distance among they were calculated. The problem was solved in excel spreadsheet and solver was used to find the optimum result i.e. shortest possible for the tourist out of (n-1)! Ways between n num-bers of places. This project help to save the time and money of the tourist by selecting the optimum route. This will certainly flourish the optimization technique in the field of the tourism industry.

DOI: 10.33545/26633582.2019.v1.i2a.20

Pages: 51-55 | Views: 914 | Downloads: 441

Download Full Article: Click Here