Variable neighborhood search for the dial-a-ride problem.
Sophie N. ParraghKarl F. DoernerRichard F. HartlPublished in: Comput. Oper. Res. (2010)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- neighborhood search
- routing problem
- hybrid method
- minimum spanning tree
- benchmark instances
- vehicle routing problem
- single machine scheduling problem
- path relinking
- search procedure
- simulated annealing
- optimal solution
- combinatorial optimization problems
- spanning tree
- benchmark problems
- optimization problems
- worst case
- search space