A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles

@article{Lim2005ATH,
title={A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles},
author={Andrew Lim and Xingwen Zhang},
journal={Proceedings of the 38th Annual Hawaii International Conference on System Sciences},
year={2005},
pages={82c-82c}
}

The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the customers' time window constraints and the vehicle capacity constraint. The m-VRPTW is a variant of the VRPTW in which a limited number of vehicles is available. A feasible solution to m-VRPTW may contain some unserved customers due to the insufficiency of vehicles. The primary objective of m-VRPTW is to maximize the… CONTINUE READING