基于改进离散粒子群优化算法的作战弹药分配研究  

RESEARCH ON DISTRIBUTION OF SERVICE AMMUNITION BASED ON IMPROVED DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM

作　　者：赵志宁[1,2] 石全[1] 张军刚[3] 

机构地区：[1]军械工程学院装备指挥与管理系,石家庄050003 [2]总参炮兵训练基地,河北宣化075100 [3]南京炮兵学院,南京210000

出　　处：《数值计算与计算机应用》2013年第3期205-211,共7页Journal on Numerical Methods and Computer Applications

摘　　要：结合作战弹药分配的具体实际,利用广义指派问题描述与数学模型,描述了弹药分配算法存在的问题与对策,提出了一种基于连续空间的离散粒子群优化算法以求解该模型.算法针对问题设计了特定的粒子编码方案,并引入了一种局部搜索以提高算法的局部搜索能力.算例分析表明了所提离散粒子群优化算法求解弹药分配问题的可行性.Considering the fact of the distribution of service ammunition, its mathematical model is described by generalized assignment problem. The existing problem and the countermeasure in the distribution of service ammunition is pointed. A discrete particle swarm optimization （DPSO） algorithm based on continuous space is proposed to solve the model And the algorithm designs a specific particle coding scheme based on the problem, and introduces a local search to increase the local searching ability. The example analysis shows that the proposed algorithm is feasible in solving the distribution problem of service ammunition.

关 键 词：作战弹药分配 广义指派问题 离散粒子群优化算法 粒子编码 局部搜索 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TJ410[自动化与计算机技术—计算机科学与技术]