Subproblem Separation in Logic-Based Benders' Decomposition for the Vehicle Routing Problem with Local Congestion.
Aigerim SakenStephen J. MaherPublished in: ATMOS (2023)
Keyphrases
- vehicle routing problem
- benders decomposition
- travel time
- network design problem
- transportation networks
- exact algorithms
- mixed integer
- metaheuristic
- knapsack problem
- tabu search
- combinatorial optimization
- integer programming
- combinatorial optimization problems
- traveling salesman problem
- benchmark problems
- dynamic programming
- routing problem
- np hard
- particle swarm optimization
- nonlinear programming
- simulated annealing
- pick up and delivery
- branch and bound
- linear program
- optimization problems
- mixed integer programming
- lp relaxation
- probabilistic model
- multi objective
- optimal solution
- search strategies
- feasible solution
- global constraints
- integer program
- ant colony optimization