Abstract
We present a hyper-heuristic approach to solve Orienteering Problem with Hotel Selection (OPHS). In practical applications, OPHS appears when a tourist is planning to visit various attractions and there is not enough time to reach all of them in a single day. Therefore, the tourist must build a tour within several days by selecting hotels, where each day has a different time budget. We propose a hyper-heuristic based on a Large Neighborhood Search, composed by a set of low-level heuristics that satisfy the different constraints associated with the problem. We put special emphasis on collaboration between low-level heuristics in order to guide the algorithm to more promising areas. We use 395 benchmark instances with known optimal solutions. This approach proves to be a more general method, with a simpler design compared to the literature, and is able to find 217 of the 395 known optimal solutions, in acceptable computational times.
Highlights
Trip planning including visit to local attractions and accomodations, is a major concern for tourists
We propose a hyper-heuristic based on a Large Neighborhood Search (LNS) [33] for solving Orienteering Problem with Hotel Selection (OPHS), which is composed of fifteen low-level heuristics classified according to the exploration or intensification of the search
EXPERIMENTS AND RESULTS We have performed experiments with benchmark instances proposed in the literature
Summary
Trip planning including visit to local attractions and accomodations, is a major concern for tourists. Every tourist must select the best attractions to visit and make the most effective trip (path) in order to have the best possible journey. This problem is known to be a very challenging one because there are many possible tours, but defining a good sequence of hotels is a hard task. It is important to select the best located hotel for each trip This problem can be represented as a graph where each node is a hotel or an attraction. The day, from this last hotel (second trip), the tourist visits new tourist attractions until arriving at the final hotel (hm)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.