A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem.
Hipólito Hernández-PérezInmaculada Rodríguez MartínJuan José Salazar GonzálezPublished in: Comput. Oper. Res. (2009)
Keyphrases
- grasp with path relinking
- path relinking
- multi start
- variable neighborhood descent
- tabu search
- metaheuristic
- solution quality
- iterated local search
- column generation
- dynamic programming
- simulated annealing and tabu search
- simulated annealing
- scatter search
- search procedure
- optimal solution
- max min
- parallel genetic algorithm
- hybrid learning
- solution space
- traveling salesman problem
- combinatorial optimization
- constraint satisfaction
- heuristic methods
- stochastic approximation