A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem.
Artur Alves PessoaEduardo UchoaMarcus Poggi de AragãoPublished in: Networks (2009)
Keyphrases
- vehicle routing problem
- benchmark problems
- dynamic programming
- np hard
- probabilistic model
- simulated annealing
- optimal solution
- combinatorial optimization
- particle swarm optimization
- computational complexity
- optimization algorithm
- benchmark instances
- worst case
- cost function
- tabu search
- special case
- convex hull
- knapsack problem
- objective function
- differential evolution algorithm
- vehicle routing problem with time windows