Abstract:

This paper aims to establish a model of finding the shortest path for travelling within the town of Phuket.  This is the travelling salesman problem which has to visit several tourist attractions in a single search as well as stopping over a restaurant for lunch within a time constraint.  The authors compared two methods between using pure genetic algorithm and heuristic with genetic algorithm with the tourist attraction nodes both inside and outside the town of Phuket area.  The experimental finding indicates that using heuristic with genetic algorithm gave a shorter distance than using pure genetic algorithm, especially in terms of a high number of desired tourist attractions.  This is because using heuristic with genetic algorithm provides data preparation steps for genetic algorithm method and will not select tourist attraction node outside the town of Phuket area unlike using pure genetic algorithm.