Optimization models for underway replenishment of a dispersed carrier battle group
MetadataShow full item record
This thesis presents a classification of basic optimization models for planning underway replenishment of a battle group. In particular, this thesis focuses on two scenarios, routine and rearming, and considers three replenishment tactics: circuit rider, delivery boy and gas station. Some of the models presented can be classified as a (standard) traveling salesman, generalized traveling salesman or orienteering problem. However, several models are further generalizations of these problems which have not been previously considered. Computational experiments using four formations from the literature and commercially available software identify problems that are difficult to solve and/or require specialized algorithms. Optimization, Integer Programming, Traveling Salesman Problem.
RightsCopyright is reserved by the copyright owner.
Showing items related by title, author, creator and subject.
Buss, Arnold (Monterey, California: Naval Postgraduate School., 2004);A recurring dilemma in the use of simulation models for analytic support of decision-making has been the length of time required to build the simulation model. Although emerging simulations have improved over legacy models, ...
Taylor, Ian (Monterey, California: Naval Postgraduate School, 2017-09);This research presents the first accurate three and six Degree of Freedom (DOF) models of the small diameter REMUS 100 with cross-tunnel thrusters (CTT). These are the first known hydrodynamic models to explicitly consider ...
Chatzigeorgiadis, Filippos (Monterey California. Naval Postgraduate School, 2006-09);The significance of the Radar Cross Section (RCS) in the outcome of military engagements makes its prediction an important problem in modern Electronic Warfare. The POFACETS program, previously developed at the Naval ...