A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints.
Xiangyi ZhangLu ChenMichel GendreauAndré LangevinPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- benchmark problems
- vehicle routing problem
- combinatorial optimization
- np hard
- dynamic programming
- optimal solution
- computational complexity
- optimization algorithm
- iterated local search
- vehicle routing problem with time windows
- memetic algorithm
- test problems
- hybrid algorithm
- search strategy
- tabu search
- metaheuristic
- simulated annealing
- worst case
- routing problem
- lower and upper bounds
- benchmark instances
- vehicle routing
- search space
- objective function