Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows.
Ramon Faganello FachiniVinícius Amaral ArmentanoPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- vehicle routing problem with time windows
- benders decomposition
- exact algorithms
- vehicle routing problem
- knapsack problem
- approximation algorithms
- network design problem
- mixed integer
- combinatorial optimization
- exact solution
- valid inequalities
- integer programming
- combinatorial optimization problems
- routing problem
- heuristic methods
- max sat
- benchmark problems
- dynamic programming
- tabu search
- particle swarm optimization
- combinatorial problems
- traveling salesman problem
- optimal solution
- np hard
- travel time
- continuous variables
- special case
- search algorithm
- neural network
- genetic algorithm