| Summary: | Approved for public release; distribution is unlimited. === 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.
|
|---|
