Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent.
Dagoberto R. Quevedo-OrozcoRoger Z. Ríos-MercadoPublished in: Comput. Oper. Res. (2015)
Keyphrases
- variable neighborhood descent
- multi start
- iterated local search
- vehicle routing problem
- search procedures
- metaheuristic
- global optimization
- path relinking
- search algorithm
- tabu search
- genetic algorithm
- single source
- variable neighborhood search
- search strategies
- search space
- scheduling problem
- search procedure
- np hard