An approach to the asymmetric multi-depot capacitated arc routing problem.
Dmitry KrushinskyTom Van WoenselPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- multi depot
- routing problem
- vehicle routing problem with time windows
- vehicle routing problem
- scheduling problem
- memetic algorithm
- routing algorithm
- shortest path
- lower bound
- np hard
- metaheuristic
- benchmark problems
- column generation
- lower and upper bounds
- tabu search
- traveling salesman problem
- travel time
- cost function