During the past decades, several joint maintenance and inventory optimization systems have been studied in literature. Compared to the sequential optimization of both models, Kabir and Al-Olayan (1996) reported a remarkable influence on total cost due to their joint optimization method. This...

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...

This paper introduces a fast solution procedure to solve 100-node instances of the time-dependent orienteering problem (TD-OP) within a few seconds of computation time. Orienteering problems occur in logistic situations were an optimal combination of locations needs to be selected and the...