A Branch-and-Price-and-Cut Algorithm for the Vehicle Routing Problem with Two-Dimensional Loading Constraints.
Xiangyi ZhangLu ChenMichel GendreauAndré LangevinPublished in: Transp. Sci. (2022)
Keyphrases
- vehicle routing problem
- np hard
- benchmark problems
- routing problem
- cost function
- dynamic programming
- worst case
- optimization algorithm
- combinatorial optimization
- information retrieval
- memetic algorithm
- hybrid algorithm
- knapsack problem
- tabu search
- optimal solution
- neural network
- particle swarm optimization
- linear programming
- test problems
- lower and upper bounds