A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem.
Somayeh AllahyariMajid SalariDaniele VigoPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- vehicle routing problem
- hybrid metaheuristic
- benchmark problems
- vehicle routing problem with time windows
- routing problem
- multi depot
- benchmark instances
- np hard
- dynamic programming
- combinatorial optimization
- memetic algorithm
- metaheuristic
- scatter search
- objective function
- particle swarm optimization
- tabu search
- knapsack problem
- hybrid algorithm
- optimization algorithm
- simulated annealing
- job shop scheduling problem
- computational complexity
- optimal solution
- heuristic search
- convex hull
- combinatorial optimization problems
- lower and upper bounds
- scheduling problem
- search space
- genetic algorithm