New Instances for the Orienteering Problem with Hotel Selection (OPHS)
These instances are new OPHS instances that have been created based on the instances for the Traveling Salesman Problem with Hotel Selection (TSPHS). The TSPHS instances with at most 500 customers have been considered to construct five new sets of OPHS instances. In each set, the instances have the same number of trips. The sets are referred to as “SET x – y – z ” where x is the number of hotels excluding H0 and H1, y is the number of trips, and z is the name of the problem (VRP or TSP) whose instances have been used to construct the original TSPHS instances. The detailed structure of these files is described in the Format description file.