Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm.
Michiel A. J. uit het BroekAlbert H. SchrotenboerBolor JargalsaikhanKees Jan RoodbergenLeandro C. CoelhoPublished in: Oper. Res. (2021)
Keyphrases
- vehicle routing problem with time windows
- np hard
- dynamic programming
- randomly generated
- objective function
- particle swarm optimization
- linear programming
- cost function
- worst case
- computational complexity
- traveling salesman problem
- primal dual
- benchmark problems
- mixed integer programming
- valid inequalities
- routing problem
- constraint programming
- vehicle routing problem
- convergence rate
- simulated annealing
- search space
- optimal solution