野战指控系统机动时间路线优化研究  

Optimized Mobile Path of Battle Field Command and Control System

作　　者：朱孟平[1] 滕贺颖[1] 白俊[1] 

机构地区：[1]解放军理工大学通信工程学院,江苏南京210017

出　　处：《指挥控制与仿真》2009年第5期30-32,共3页Command Control & Simulation

基　　金："十一五"国防预研基金(9140A06040107JB8101)

摘　　要：以战时指控系统的机动路线优化问题为研究对象,建立了野战指控系统机动时间路线模型,在此模型的基础上提出用遗传算法来解决时间路线优化问题。初步处理了作战过程机动路线的必经点问题。在此基础上总结提出了机动路线优化的算法,将此算法在机步师野战指控系统遂行作战进行了验证。此算法可用来解决当前指控系统机动时间路线优化的问题。最后提出需要进一步解决的问题。The case of optimized mobile path of battle field Command and Control System （C2S） is studied. A model of stochastic chance constrained programming is constructed. On its basis, the genetic algorithm is put forward to solve it. The necessity-node in war is processed. And the method about how to optimize path with stochastic is given. An experiment of C2S of mobile division which uses this method is shown the effectiveness. Its result is compared and can be used to solve the problem to choose paths during C2S movement. The further problems are proposed finally.

关 键 词：野战指控系统 路线优化 遗传算法 

分 类 号：E911[军事] E072