Abstract: Highlights•We define and mathematically model the time-dependent orienteering problem (TD-OP).•We developed a large set of realistic test instances with known optimal solutions.•We present an efficient local search procedure to deal with time-dependency.•We design an efficient and effective metaheuristic to tackle the TD-OP.•The performance concerning quality and computation time is verified
Loading