A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows

This paper considers the vehicle routing problem with soft time windows, a challenging routing problem where customers' time windows may be violated at a certain cost. The vehicle routing problem with soft time windows has a lexicographic objective function, aimed at minimizing first the number of routes, then the number of violated time windows, and finally the total routing distance. We present a multistage very large-scale neighborhood search...