Abstract:

The problem of underway replenishment path planning for the supply ship in a carrier battle group is investigated. According to the network flows theory, three replenishment tactics for underway -replenishment are presented: delivery boy, gas station and circuit rider. In each replenishment tactic, two underway replenishment path planning models are given. The objective of one model is to minimize the time to replenish all ships, while the other is to maximize the replenishment values. Finally， a typical example is given, and the computational results show that the delivery boy tactic is more effective and practically useful in computing time and planning results. The results of this paper can provide quantity basis and theory guidance for the underway replenishment path planning for the supply ship in a carrier battle group.