A Column Generation Procedure for the Split Delivery Vehicle Routing Problem Using a Route-Based Formulation.
Joseph Hubert Wilck IVTom M. CavalierPublished in: Int. J. Oper. Res. Inf. Syst. (2014)
Keyphrases
- vehicle routing problem with simultaneous
- vehicle routing problem
- set partitioning
- column generation
- vehicle routing problem with time windows
- vehicle routing
- routing problem
- pick up and delivery
- integer program
- travel time
- greedy randomized adaptive search procedure
- metaheuristic
- dantzig wolfe decomposition
- lagrangean relaxation
- traveling salesman problem
- benchmark problems
- tabu search
- cutting plane algorithm
- optimal solution
- valid inequalities
- test instances
- np hard
- branch and bound
- linear programming relaxation
- memetic algorithm
- integer programming
- linear program
- mixed integer programming
- linear programming
- constraint programming
- particle swarm optimization
- search strategies
- exact solution
- combinatorial optimization
- knapsack problem
- cutting plane
- search procedure
- scatter search
- lagrangian relaxation
- feasible solution
- search methods
- simulated annealing
- multi objective
- search space
- lower bound
- search algorithm