Metaheuristics for the Orienteering Problem with Hotel Selection KU Leuven
Formally, the Team Orienteering Problem with Hotel Selection (TOPHS) can be stated as follows: a set of n customer locations is given and each location i = s + 1, . . . , s + n is assigned a service or visiting timeTi and a score Si. The time Cij needed to travel from location i to j is known for all pairs of customer locations. The available time that each trip d = 1, . . . ,m takes is limited to a given time budget C. The goal is to ...