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 routing between the selected locations needs to be optimized. In the time-dependent variant, the travel time between two locations depends on the departure time at the first location. Next to a mathematical formulation of the TD-OP, the main contribution of this paper is the design of a fast and effective algorithm to tackle this problem. This algorithm combines the principles of an ant colony system (ACS) with a time-dependent local search procedure equipped with a local evaluation metric. Additionally, realistic benchmark instances with varying size and properties are constructed. The average score gap with the known optimal solution on these test instances is only 1.4% with an average computation time of 0.5 seconds. An extensive sensitivity analysis shows that the performance of the algorithm is insensitive to small changes in its parameter settings. © 2014 Elsevier B.V. All rights reserved.
https://doi.org/10.1016/j.ejor.2013.11.038Cite as:
@article{Verbeeck_2014,
doi = {10.1016/j.ejor.2013.11.038},
url = {https://doi.org/10.1016%2Fj.ejor.2013.11.038},
year = 2014,
month = {jul},
publisher = {Elsevier {BV}},
volume = {236},
number = {2},
pages = {419--432},
author = {C. Verbeeck and K. Sörensen and E.-H. Aghezzaf and P. Vansteenwegen},
title = {A fast solution method for the time-dependent orienteering problem},
journal = {European Journal of Operational Research}
}