Nowadays, by help of tourist trip planners, in many travel destinations, the trip itinerary could be prepared automatically. The trip planners enable customization of trip itinerary based on tourist preferences, available time and budget, where the itinerary is optimized by using optimization techniques from the field of metaheuristics. In this paper, we present a new approach based on simulated annealing algorithm for solving the tourist trip planning problem. The hard constraints include limited trip duration, working hours of points of interest (POIs) and tourist budget, while tourist preferences and traveling time comprise the soft constraints, which take part in a two component function for evaluation of quality of solutions. The search space is explored by using three types of operators, namely insert, swap and shake. The algorithm is tested against some real test data for the city of Prishtina in Kosova. In addition to fine tuning the values of algorithm parameters, further experiments are made for exploring different approaches of construction of initial solution, time duration of algorithm execution for various trip lengths, and influence of shake operator into the solution quality.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.