Scheduling underway replenishment as a generalized orienteering problem
Dunn, Jeffrey Scott
Dell, Robert F.
Hartman, Douglas M.
MetadataShow full item record
The replenishment of a dispersed battle group requires logistic ships to travel long distances between ships in the battle group. When operational requirements limit the amount of time that can be spent conducting replenishment, decision makers must select which ships to replenish based on the amount of time needed to transit between ships, and the combat value added to the battle group by replenishment. With proper assumptions, this problem in analogous to the Generalized Orienteering Problem. A dynamic programming algorithm is developed using this approach and tested against a set of test problems. The algorithm is capable of scheduling replenishment using both Delivery Boy, or Circuit Rider tactics. The results indicate that the algorithm runs quickly enough to be useful for scheduling underway replenishment in operational situations.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Diaz, Andres (Monterey, California. Naval Postgraduate School, 2010-03);The United States Navy (USN) globally deploys to protect and sustain a peaceful international system of interdependent trade, information and social networks through a spectrum of capabilities, including humanitarian aid ...
Pagliaro, Daniel E. (Monterey, California. Naval Postgraduate School, 2008-03);Accurate severe thunderstorm forecasts are critical to providing sufficient leadtime to protect lives and property. The Air Force Weather Agency has developed a 3-Element Severe Weather Forecast Algorithm that when applied ...
Rodrigues Neto, Jose Augusto (Monterey, California. Naval Postgraduate School, 1994-12);This thesis develops, implements and tests a mine search algorithm for the Naval Postgraduate School Autonomous Underwater Vehicle (Phoenix). The vehicle is 72 inches long and displaces 400 pounds. Its maneuvers are performed ...