In this paper, a memetic algorithm is developed to solve the orienteering problem with hotel selection (OPHS). The algorithm consists of two levels: a genetic component mainly focuses on finding a good sequence of intermediate hotels, whereas six local search moves embedded in a variable...

In this paper, we present the orienteering problem with hotel selection (OPHS), an extension of the orienteering problem (OP). In the OPHS, a set of vertices with a score and a set of hotels are given. The goal is to determine a fixed number of connected trips that visits some vertices and...