A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes.
Tino HenkeM. Grazia SperanzaGerhard WäscherPublished in: Ann. Oper. Res. (2019)
Keyphrases
- vehicle routing problem
- search space
- search strategy
- optimal solution
- routing problem
- objective function
- optimization problems
- benchmark problems
- combinatorial optimization
- np hard
- cost function
- evolutionary algorithm
- computational complexity
- worst case
- simulated annealing
- particle swarm optimization
- vehicle routing problem with time windows
- dynamic programming
- optimization algorithm
- metaheuristic
- data structure
- memetic algorithm
- benchmark instances