An Overview of Vehicular Scheduling Problems.

reportActive / Technical Report | Accession Number: AD0787556 | Need Help?

Abstract:

This paper provides a taxonomy for vehicular scheduling problems. Scheduling problems are classified as node or discrete routing, represented by the traveling salesman problem and branch or continuous routing, represented by the chinese postman problem. These problems can also be classified in the private and public sector respectively reflecting different constraints and objectives. Further refinements exist, for example, distinguishing one and many vehicle routing. These distinctions dictate the approach and solution technique of such problems. Author

Author(s):
Gabbay, Henry
Author Organization(s):
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Descriptive Note:
Technical rept.,
Pagination:
0026

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-103
Contract/Grant Number(s):
N00014-67-A-0204-0076
Project Number(s):
NR-347-027, MIT-OSP-81138
 Subject Terms
Joint Capability Areas:
JCA_6.1.3_Switching and Routing; JCA_6.1_Information Transport; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*Scheduling, *Delivery, Routing, Algorithms
Field(s)/Group(s):
Operations Research
Keyword(s):
Traveling salesman problem, Chinese postman problem, Shortest route method
Report Date:
1974 Sep 01