An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems.
Mir Ehsan Hesam SadatiBülent ÇatayDeniz AksenPublished in: Comput. Oper. Res. (2021)
Keyphrases
- vehicle routing problem
- multi depot
- variable neighborhood search
- tabu search
- metaheuristic
- routing problem
- vehicle routing problem with time windows
- scheduling problem
- benchmark instances
- search procedure
- neighborhood search
- simulated annealing
- path relinking
- test instances
- combinatorial optimization problems
- feasible solution
- genetic algorithm
- np hard
- traveling salesman problem
- memetic algorithm
- scatter search
- combinatorial optimization
- ant colony optimization
- benchmark problems
- travel time
- heuristic methods
- neural network
- optimization problems
- particle swarm optimization
- max sat
- job shop scheduling problem
- combinatorial problems
- search algorithm
- minimum spanning tree
- np complete
- search strategies
- knapsack problem