Computer Science ›› 2018, Vol. 45 ›› Issue (6A): 559-561.

• Interdiscipline & Application • Previous Articles     Next Articles

Object Optimization Research of Underway Materials Resupplying for Battle Group

QIN Fu-rong,LUO Zhao-hui,DONG Peng   

  1. Department of Management Engineering,Naval University of Engineering,Wuhan 430033,China
  • Online:2018-06-20 Published:2018-08-03

Abstract: In order to improve the process of battle group’s underway materials resupplying,this research analyzed the whole process of underway replenishment scheduling and the necessity of transportation scheduling.Afterwards,a comparison between ordinary emergency resources scheduling and underway materials transportation scheduling was made,and the similarities and differences were analyzed.Then,based on requirements of transportation scheduling,this research presented a multi-objective optimization model by taking the minimum task completion time and the minimum task cost as objectives.Lastly,an algorithm was designed to solve this scheduling problem and a typical example is gi-ven.A reasonable scheme is obtained by using models and algorithm above,which verifies effectiveness and feasibility of the algorithm.

Key words: Underway battle group, Underway materials resupplying, Transportation scheduling

CLC Number: 

  • E953
[3]SHEU J B.Dynamic Relief-Demand Management for Emergency Logistics Operations under Large-Scale Disasters[J].Transaction Research Part E,2010,46(1):1-17.
[6]BARBAROSOLU G,ARDA Y.A two-stage stochastic pro- gramming framework for transportation planning in disaster response[J].Journal of the Operational Research Society,2004,55(1):43-53.
No related articles found!
Full text



[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .