Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach.
Aaron Luntala NsakandaMoustapha DiabyYuheng CaoPublished in: Int. Trans. Oper. Res. (2011)
Keyphrases
- routing problem
- set partitioning
- dantzig wolfe decomposition
- setup times
- vehicle routing problem with time windows
- vehicle routing problem
- vehicle routing
- scheduling problem
- lot sizing
- multi item
- routing algorithm
- shortest path
- column generation
- travel time
- lagrangian relaxation
- single machine
- traveling salesman problem
- processing times
- total cost
- production cost
- tabu search
- upper bound