Optimization models for underway replenishment of a dispersed carrier battle group

Thumbnail Image
Files
92Mar_Wu.pdf (2.32 MB)
Authors
Wu, Tzu-li
Subjects
Optimization
Integer programming
Traveling salesman problem
Advisors
Dell, Robert
Lawphongpanich, Siriphong
Date of Issue
1992-03
Date
1992-Mar
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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.
Type
Thesis
Description
URI
https://hdl.handle.net/10945/30607
Series/Report No
Department
Department of Operations Research
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
86 p.;28 cm.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner.
Collections
Theses