| Description |
The Vehicle Routing Problem with Time Windows (VRPTW) is a vehicle routing problem in which a fleet of identical vehicles of finite capacity and located at a central depot must service a set of customers with known demands and specific time window. The objective is to determine a set of vehicle trips of minimum total cost (sum of travel distance or time), such that each vehicle starts and ends at the depot, each client is visited exactly once and within his/her time window, and the total demand handled by any vehicle does not exceed its capacity. |