Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem.
María SotoMarc SevauxAndré RossiAndreas ReinholzPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- vehicle routing problem
- neighborhood search
- tabu search
- multi depot
- metaheuristic
- simulated annealing
- path relinking
- vehicle routing problem with time windows
- variable neighborhood search
- routing problem
- scheduling problem
- benchmark instances
- memetic algorithm
- search procedure
- genetic algorithm
- heuristic methods
- test problems
- test instances
- benchmark problems
- feasible solution
- traveling salesman problem
- combinatorial optimization problems
- search algorithm
- hybrid algorithm
- travel time
- evolutionary algorithm
- combinatorial optimization
- nature inspired
- np hard
- scatter search
- job shop scheduling problem
- ant colony optimization
- computational complexity
- optimization problems
- multi objective
- search space
- search heuristics
- max sat
- genetic algorithm ga
- branch and bound