Vehicle routing algorithms for local delivery at Naval supply centers
Clausen, Clifford O.
McMasters, Alan W.
Brown, Gerald G.
MetadataShow full item record
This thesis examines the local delivery operations at the Naval Supply Center 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.
RightsThis 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.
Showing items related by title, author, creator and subject.
Le, F.; Zhang, H.; Xie, Geoffrey (2011-12);Route Aggregation (RA), the method to supersede a set of routes by a single, more general route, is a fundamental mechanism to the Internet scalability. Yet, despite its importance, it is poorly understood. We present the ...
Sun, X.; S. Rao; Xie, Geoffrey (2012-12);Enterprise networks often have complex routing designs given the need to meet a wide set of resiliency, security and routing policies. In this paper, we take the position that minimizing design complexity must be an explicit ...
Thong, Lee Kok (Monterey, California. Naval Postgraduate School, 2004-12);This thesis presents a simulation and performance evaluation analysis of the various routing protocols that have been proposed for the Mobile Ad Hoc Network (MANET) environment using the Network Simulator-2 (NS-2) tool. ...