An Overview of Vehicular Scheduling Problems.
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Pagination or Media Count:
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
- Operations Research