In this research, we developed a skewed variable neighbourhood search algorithm to solve the orienteering problem (OP) with hotel selection, a non-investigated variant of the OP. We also designed two appropriate sets of benchmark instances with known optimal solutions. Applying the proposed algorithm on these instances shows the quality of the algorithm. The algorithm is also fast enough to be implemented in a tourist application

Cattruysse, D