Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems

The computational performance of the proposed approaches is assessed in an extensive computational study, using real-world instances that combine crowd-sourced data associated with the Pokémon GO game with street maps of three European cities, as well as instances derived from the TSPLIB testbed. The obtained results show that the B&C approach (i) largely outperforms the B&B algorithm, and that (ii) it is very effective for providing optimal or nearly-optimal solutions within reasonable running times for both sets of instances.