An investigation into the vehicle routing problem with time windows and link capacity constraints

► We define and model a new, yet practical, variant of the vehicle routing problem. ► New constraints can greatly reduce the effectiveness of traditional approaches. ► We develop new problem instances and a tabu search heuristic. ► We conclude that the tabu search heuristic is effective from benchmark results.