Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Ordnance Industry Automation》 2018-10
Add to Favorite Get Latest Update

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

Qin Furong;Luo Zhaohui;Dong Peng;Department of Management Engineering,Naval University of Engineering;  
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.
【Fund】: 海军工程大学科研自主立项项目(20161613);海军工程大学科研自主立项项目(20161614)
【CateGory Index】: E91;E925.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved