Complexity Of Vehicle Routing And Scheduling Problems

Preprint

preprint

Published in RePEc

Abstract

The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park from June 4 to June 6, 1979.

Keywords

COLLEGE
VEHICLE ROUTING
WORKSHOP
CREWS
SCHEDULING PROBLEMS
COMPILE
ROUTING AND SCHEDULING OF VEHICLES

All Related Versions

Version 1, RePEc

This publication has 0 references indexed in Scilit: