Method of underway replenishment routine project for agroup of ships based on ant colony algorithm

The comparison of the underway replenishment routine project(URRP)with the conventional traveling salesman problem(TSP)leads to an understanding of similarity and difference between them.On this basis,an improved TSP algorithm is applied to describing the URRP.According to different requirements of underway replenishment for a group of ships in peacetime and wartime, the models of URRP are set up respectively,and the target functions are defined.Ant colony algorithm is used to solve URRP.With the URRP in peacetime as an example,the optimal route of underway replenishment is worked out,which verifies the feasibility of the models and the algorithm.