A variable neighborhood search-based algorithm with adaptive local search for the Vehicle Routing Problem with Time Windows and multi-depots aiming for vehicle fleet reduction.
Sinaide Nunes BezerraMarcone Jamilson Freitas SouzaSérgio Ricardo de SouzaPublished in: Comput. Oper. Res. (2023)
Keyphrases
- vehicle routing problem
- vehicle routing problem with time windows
- routing problem
- benchmark problems
- variable neighborhood search
- simulated annealing
- optimal solution
- computational complexity
- multi depot
- metaheuristic
- np hard
- tabu search
- search space
- combinatorial optimization
- traveling salesman problem
- particle swarm optimization
- search procedure
- benchmark instances
- dynamic programming
- solution quality
- linear programming
- hill climbing
- job shop scheduling problem