基于GTSP问题的舰艇编队海上补给规划  

Scheduling of Underway Replenishment for a Battle Group Based on Generalized Traveling Salesman Problem

作　　者：秦芙蓉[1] 罗朝晖[1] 董鹏[1] Qin Furong;Luo Zhaohui;Dong Peng(Department of Management Engineering,Naval University of Engineering,Wuhan 430033,China)

机构地区：[1]海军工程大学管理工程系,武汉430033

出　　处：《兵工自动化》2018年第10期28-31,共4页Ordnance Industry Automation

基　　金：海军工程大学科研自主立项项目(20161613);海军工程大学科研自主立项项目(20161614)

摘　　要：为研究综合补给舰为舰艇编队实施伴随保障的物资补给过程,对舰艇编队海上补给规划问题进行研究。阐述伴随保障方式下3种常见补给策略,以巡回牧师策略为例,以最小补给时间为目标建立海上补给规划问题模型,将该问题类比为广义旅行商问题(generalized travel salesman problem,GTSP)并运用启发式算法进行求解。以某舰艇编队物资补给任务为算例进行计算,得出了该补给任务的最小补给时间及最优补给路径。结果表明:将海上补给规划问题类比为GTSP问题能有效实现问题求解,模型及算法能够为海上伴随补给保障提供决策支持。In order to study the replenishment process of the comprehensive supply ship for the warship formation to implement the accompanying support, the underway replenishment planning of the warship formation is studied. This paper expounds three common replenishment strategies under the accompanied support mode. Taking the touring pastor strategy as an example, an underway replenishment planning model is established with the goal of minimum replenishment time. This problem is analogous to the generalized travel salesman problem （GTSP） and solved by using heuristic algorithm. The minimum replenishment time and optimal replenishment path of a warship formation are obtained by taking the replenishment task of a warship formation as an example. The results show that the analogue of the seaborne supply planning problem to the GTSP problem can effectively solve the problem, and the model and algorithm can provide decision support for the seaborne adjoint replenishment support.

关 键 词：海上补给规划 补给策略 广义旅行商问题 启发式算法 

分 类 号：TJ83[兵器科学与技术—武器系统与运用工程]