scientific article
From MaRDI portal
Publication:2956989
zbMath1353.90182MaRDI QIDQ2956989
Roberto Montemanni, Luca Maria Gambardella
Publication date: 20 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Iterated local search for the team orienteering problem with time windows ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Scheduled penalty variable neighborhood search ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Bi-objective orienteering for personal activity scheduling ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ Deep infeasibility exploration method for vehicle routing problems ⋮ The capacitated team orienteering problem with incomplete service ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ Coupling ant colony systems with strong local searches ⋮ The orienteering problem: a survey ⋮ Formulations for the orienteering problem with additional constraints ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers
This page was built for publication:
