Login / Signup
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints.
Pamela J. Palomo-Martínez
M. Angélica Salazar-Aguilar
Gilbert Laporte
André Langevin
Published in:
Comput. Oper. Res. (2017)
Keyphrases
</>
variable neighborhood search
metaheuristic
routing problem
tabu search
traveling salesman problem
multi objective
heuristic methods
single machine scheduling problem
hybrid method
evolutionary algorithm
constraint satisfaction