The multiple vehicle TSP with time windows and equity constraints over a multiple day horizon

This paper considers the multiple vehicle traveling salesman problem cast over a multiple day routing scenario, with time windows and equity constraints. It develops an optimal column generation procedure and heuristic variations which solve test problems derived from the overnight delivery business. Extensive empirical testing indicates the judicious chose of a few routes for each day can incorporate equity at little or no additional cost.