Feature and Algorithm Selection for Capacitated Vehicle Routing Problems.
Jussi RaskuNysret MusliuTommi KärkkäinenPublished in: ESANN (2019)
Keyphrases
- np hard
- vehicle routing problem
- worst case
- routing problem
- cost function
- dynamic programming
- objective function
- computational complexity
- vehicle routing problem with time windows
- linear programming
- benchmark problems
- optimization algorithm
- search procedure
- knapsack problem
- traveling salesman problem
- particle swarm optimization
- optimal solution
- convex hull
- spanning tree
- search space
- benchmark instances