Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems.
Artur Alves PessoaRuslan SadykovEduardo UchoaPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- benchmark problems
- cost function
- dynamic programming
- objective function
- optimization algorithm
- vehicle routing problem
- np hard
- worst case
- simulated annealing
- knapsack problem
- np complete
- variable neighborhood search
- vehicle routing problem with time windows
- greedy algorithm
- metaheuristic
- linear programming
- lower bound