A simple GRASP+VND for the travelling salesperson problem with hotel selection

In this paper, we present a new metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS). We develop a simple but powerful metaheuristic for the TSPHS. On the existing benchmark instances for which an optimal solution is known, it obtains 27 out of 28 known optimal solutions. For the other instances, it obtains several new best known solutions. This heuristic clearly outperforms the only existing heuristic in the literature.