Vehicle Routing Algorithms for Local Delivery at Naval Supply Centers.
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
This thesis examines the local delivery operations at the Naval Supply Centers in Oakland and San Diego. The local delivery problem is formulated as a model applicable to these supply centers. Specifically, the model involves routing a fleet of vehicles from a central depot to each of a set of customers so as to satisfy their demands. Twelve heuristic solution methods applicable to this model are reviewed and illustrated with examples. They are also compared with respect to quality of resulting solutions and computational efficiency. Finally, recommendations on improving the routing of vehicles at the two Naval Supply Centers are made. Author
- Theoretical Mathematics
- Military Operations, Strategy and Tactics