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

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

0.00 Avg rating0 Votes
Article ID: iaor1997202
Country: United States
Volume: 30
Issue: 2
Start Page Number: 120
End Page Number: 133
Publication Date: May 1996
Journal: Transportation Science
Authors: , ,
Keywords: programming: travelling salesman
Abstract:

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 choice of a few routes for each day can incorporate equity at little or no additional cost.

Reviews

Required fields are marked *. Your email address will not be published.