Abstract
Experiencing local food while making a trip has a significant impact on the overall tourist experience. No wonder that visiting local restaurants has become an integral part of a tourist itinerary. Nevertheless, manually planning a travel itinerary is a complicated and time-consuming task. This study aims to introduce and solve a planning problem for generating a high-quality itinerary consisting of an efficient route to visit tourist attractions and restaurants at a proper time. We modeled this problem as a rooted orienteering problem with time windows, where the selected restaurants should be scheduled within lunch and dinner time. The objective is to maximize the total collected utility in each visited locations while maintaining the total travel time under a specific constraint. We developed a Genetic Algorithm to solve the problem and presented Yogyakarta city as a case study. The result suggested that the developed algorithm can effectively solve the problem and generate a satisfactory solution with a high total utility value.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
