Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem.
Konstantin PavlikovNiels Christian PetersenJon Lilholt SørensenPublished in: Networks (2024)
Keyphrases
- capacity constraints
- sufficient conditions
- linear inequalities
- metaheuristic
- vehicle routing problem
- network flow
- bayesian networks
- dynamic programming
- ant colony optimization
- memetic algorithm
- cutting plane algorithm
- case study
- high capacity
- bicriteria
- vehicle routing problem with time windows
- brute force
- branch and bound algorithm
- np hard
- search space
- lower bound
- optimal solution