Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows

Authors:

Abstract
In the Vehicle Routing Problem with Time Windows, a set of customers are servedby a fleet of vehicles of limited capacity, initially located at a central depot. Eachcustomer provides a period of time in which they require service, which may consistof repair work or loading/unloading the vehicle. The objective is to find tours for thevehicles, such that each customer is served in its time window, the total load on anyvehicle is no more than the vehicle capacity, and the total distance...