We consider an online version of the orienteering problem, where stochastic service requests arise during a first time interval from customers located on the nodes of a graph. Every request must be accepted/rejected in real time. Later, a vehicle must visit the accepted customers during a second time interval.
We perform extensive computational tests on the proposed algorithms and discuss the pros and cons of the different methods.
ANGELELLI, E., ARCHETTI, C., FILIPPI, C. et VINDIGNI, M. (2021). A dynamic and probabilistic orienteering problem. Computers & Operations Research, 136, pp. 105454.