A combinational disruption recovery model for vehicle routing problem with time windows

Abstract

A method of transforming various delivery disruptions into new customer-adding disruption is developed. The optimal starting time of delivery vehicles is analyzed and determined, which provides a new rescue strategy (starting later policy) for disrupted VRPTW. Then the paper considers synthetically customer service time, driving paths and total delivery costs to put forward a combinational disruption recovery model for VRPTW. Finally, in computational experiments, Nested Partition Method is applied to verify the effectiveness of the proposed model, as well as the strategy and the algorithm. © 2011 Springer-Verlag Berlin Heidelberg.