A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem.
Kevin DalmeijerRemy SplietPublished in: Comput. Oper. Res. (2018)
Keyphrases
- vehicle routing problem
- benchmark problems
- computational complexity
- memetic algorithm
- np hard
- routing problem
- worst case
- particle swarm optimization
- neural network
- knapsack problem
- tabu search
- benchmark instances
- travel time
- combinatorial optimization
- optimization algorithm
- scheduling problem
- dynamic programming
- objective function