A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem.
Artur Alves PessoaMarcus Poggi de AragãoEduardo UchoaPublished in: WEA (2007)
Keyphrases
- vehicle routing problem
- benchmark problems
- computational complexity
- linear programming
- worst case
- hybrid algorithm
- knapsack problem
- benchmark instances
- tabu search
- simulated annealing
- dynamic programming
- np hard
- combinatorial optimization
- objective function
- test problems
- routing problem
- memetic algorithm
- heuristic methods
- variable neighborhood search