A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems.
Lorena S. Reyes-RubianoLaura CalvetAngel A. JuanJavier FaulinLluc BovéPublished in: J. Heuristics (2020)
Keyphrases
- multi depot
- variable neighborhood search
- vehicle routing problem
- routing problem
- metaheuristic
- vehicle routing problem with time windows
- tabu search
- benchmark instances
- neighborhood search
- traveling salesman problem
- benchmark problems
- test instances
- combinatorial optimization
- travel time
- memetic algorithm
- np hard
- knapsack problem
- ant colony optimization
- particle swarm optimization
- simulated annealing
- optimization problems
- evolutionary algorithm
- path relinking
- multi objective
- constraint programming
- scatter search
- job shop scheduling problem
- combinatorial optimization problems
- search strategies
- branch and bound