CAJ | 학술논문

提出了基于模式搜索的导弹目标分配问题的求解方法.该问题是一个带约束的非线性整数规划问题, 采用传统模式搜索求解可能产生非整数解以及陷入局部最优.通过设置模式搜索的终止条件和引入变异操作, 克服了上述问题.实践表明, 该算法运算速度快, 效率高, 鲁棒性好, 可用于导弹目标分配的决策模型.
제출료기우모식수색적도탄목표분배문제적구해방법.해문제시일개대약속적비선성정수규화문제, 채용전통모식수색구해가능산생비정수해이급함입국부최우.통과설치모식수색적종지조건화인입변이조작, 극복료상술문제.실천표명, 해산법운산속도쾌, 효솔고, 로봉성호, 가용우도탄목표분배적결책모형.
A new method based on pattern search (PS) algorithm is proposed to solve the missile target assignment problem. The problem is a non-linear integer programming problem with constraints, which means that if traditional PS is adopted, the solution may be non-integer or fall into local optimum unexpectedly. The stop criterion that ends the pattern search is redefined and the mutation operation is introduced to overcome the above shortages of traditional pattern search. It is proven by an example that the method is characterized by rapid speed of convergence, high efficiency and strong robustness, and the method can be applied to the decision model of missile target assignment.