This paper proposes a fast ant colony system based solution method to solve realistic instances of the time-dependent orienteering problem with time windows within a few seconds of computation time. Orienteering problems occur in logistic situations where an optimal combination of locations needs to be selected and the routing between these selected locations needs to be optimized. For the time-dependent problem, the travel time between two locations depends on the departure time at the first location. The main contribution of this paper is the design of a fast and effective algorithm for this problem. Numerous experiments on realistic benchmark instances with varying size confirm the state-of-the-art performance and practical relevance of the algorithm.
https://doi.org/10.1007/s10479-017-2409-3Cite as:
@article{Verbeeck_2017,
doi = {10.1007/s10479-017-2409-3},
url = {https://doi.org/10.1007%2Fs10479-017-2409-3},
year = 2017,
month = {feb},
publisher = {Springer Science and Business Media {LLC}},
volume = {254},
number = {1-2},
pages = {481--505},
author = {C{'{e}}dric Verbeeck and Pieter Vansteenwegen and El-Houssaine Aghezzaf},
title = {The time-dependent orienteering problem with time windows: a fast ant colony system},
journal = {Annals of Operations Research}
}