A column generation-based heuristic for a green vehicle routing problem with an unlimited heterogeneous fleet.
Mario ZiebuhrTobias BuerHerbert KopferPublished in: SSCI (2017)
Keyphrases
- column generation
- vehicle routing problem
- vehicle routing problem with time windows
- multi depot
- vehicle routing
- lagrangean relaxation
- tabu search
- optimal solution
- metaheuristic
- branch and bound
- combinatorial optimization
- benchmark instances
- mixed integer programming
- integer linear programming
- lagrangian relaxation
- test instances
- set partitioning
- dantzig wolfe
- linear programming
- linear programming relaxation
- grasp with path relinking
- routing problem
- integer program
- integer programming
- np hard
- constraint programming
- knapsack problem
- variable neighborhood search
- linear program
- benchmark problems
- search algorithm
- exact solution
- travel time
- memetic algorithm
- search strategies
- dantzig wolfe decomposition
- branch and bound algorithm
- cutting plane
- hybrid metaheuristic
- simulated annealing
- valid inequalities
- scatter search
- feasible solution
- traveling salesman problem
- scheduling problem
- heuristic methods
- optimization problems
- lower bound
- exact algorithms
- solution quality
- multi objective
- search procedure