In this talk, a new formulation and a new metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic is a multi-start procedure that outperforms existing heuristics on all benchmark instances. We also provide a number of new optimal solutions found by a commercial solver extended with a dedicated cutting plane procedure, as well as new best known solutions for most benchmark instances
