Applications of Travelling Salesman Problem in Optimizing Tourist Destinations Visit in Langkawi

This paper discusses about finding the best possible route for self-drive tourism in Langkawi which focused on land transportation and road network. The problem of finding the best tourism route was formulated based on the travelling salesman problem (TSP) model. This work was developed in order to determine the best route that includes all the 19 most attractive tourist destinations in Langkawi. This is because in this way, the time spent in travelling and the total travelling cost of the tourist can be minimized. It will also optimize the leisure moments as well as taking to know all the tourist destinations. The Langkawi tourism data were used to obtain the self-drive tourism route in Langkawi. This model has been solved by using LINGO12.0 software. Results from the study found that tourist need to spend 4 days to visit all 19 tourist destinations in Langkawi with the total travelling cost of RM 856.55.