Resumen
This research presents a solution to the family tourism route problem by considering daily time windows. To find the best solution for travel routing, the modified adaptive large neighborhood search (MALNS) method, using the four destructions and the four reconstructions approach, is applied here. The solution finding performance of the MALNS method is compared with an exact method running on the Lingo program. As shown by various solutions, the MALNS method can balance travel routing designs, including when many tourist attractions are present in each path. Furthermore, the results of the MALNS method are not significantly different from the results of the exact method for small problem sizes. For medium and large problem sizes, the MALNS method shows a higher performance and a smaller processing time for finding solutions. The values for the average total travel cost and average travel satisfaction rating derived by the MALNS method are approximately 0.18% for a medium problem and 0.05% for a large problem, 0.24% for a medium problem, and 0.21% for a large problem, respectively. The values derived from the exact method are slightly different. Moreover, the MALNS method calculation requires less processing time than the exact method, amounting to approximately 99.95% of the time required for the exact method. In this case study, the MALNS algorithm result shows a suitable balance of satisfaction and number of tourism places in relation to the differences between family members of different ages and genders in terms of satisfaction in tour route planning. The proposed solution methodology presents an effective high-quality solution, suggesting that the MALNS method has the potential to be a great competitive algorithm. According to the empirical results shown here, the MALNS method would be useful for creating route plans for tourism organizations that support travel route selection for family tours in Thailand.