The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon
Loading...
Authors
Dell, Robert F.
Batta, Rajan
Karwan, Mark H.
Subjects
Advisors
Date of Issue
1996-05
Date
May 1996
Publisher
Institute for Operations Research and the Management Sciences
Language
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 chose of a few routes for each day can incorporate equity at little or no additional cost.
Type
Article
Description
Series/Report No
Department
Operations Research (OR)
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Federal Express
Naval Postgraduate School Research Initiation Program
National Science Foundation- grant SES-88-10917
Naval Postgraduate School Research Initiation Program
National Science Foundation- grant SES-88-10917
Funder
Federal Express
Naval Postgraduate School Research Initiation Program
National Science Foundation- grant SES-88-10917
Naval Postgraduate School Research Initiation Program
National Science Foundation- grant SES-88-10917
Format
14 p.
Citation
Transportation Science Vol. 30, No. 2 (May 1996); p. 120-133.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.