| Summary: | Planning a tourism trip requires careful consideration, especially the travelling time, budget, and personal interests. As the number of places to visit increases, planning and prioritizing a trip effectively can be challenging. This problem is known as Tourist Trip Design Problem (TTDP). This study aims to solve TTDP that prioritizes user preference and Points of Interest (POIs) attraction popularity. The integer problem formulation of TTDP consists of a single objective function which is to maximize the benefit without exceeding the budget and allocation time. The benefit is optimizing the number of points of interest (POIs) to visit while satisfying all the constraints. A greedy algorithm is proposed that is able to consider user preference and POIs popularity. To minimize the distance traveled between POIs, the algorithm is improved by incorporating the Clarke-Wright Saving algorithm. The performance of the enhanced algorithm is tested on 37 POIs in Langkawi Island, Malaysia. In addition, the operating hours and touring time of POIs were also considered. The start node is fixed at Jetty Point and the tourist is assumed to spend at least one night there. The enhanced algorithm is coded in Matlab and results shows that a maximum of 6 POIs can be visited in a one-day trip. An insight into the itinerary's carbon footprint is also presented, taking into account the use of medium-sized cars by tourists. © 2024 Author(s).
|
|---|