Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes.
Katrin HeßlerPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- vehicle routing problem
- exact algorithms
- vehicle routing problem with time windows
- benchmark instances
- knapsack problem
- combinatorial optimization problems
- combinatorial optimization
- multi depot
- metaheuristic
- routing problem
- tabu search
- traveling salesman problem
- travel time
- hybrid metaheuristic
- vehicle routing
- approximation algorithms
- benchmark problems
- test instances
- max sat
- heuristic methods
- np hard
- particle swarm optimization
- memetic algorithm
- exact solution
- combinatorial problems
- pick up and delivery
- optimization problems
- simulated annealing
- optimal solution
- scatter search
- column generation
- search strategies
- upper bound
- reinforcement learning