CAJ | 학술논문

描述了火力分配问题(WTA)及其数学模型,简要介绍了基本蚁群算法,着重分析了其不足,并在移动选择策略上进行了改进,借鉴了遗传算法中的交叉、变异增加了解的多样性,拓展了搜索空间,针对WTA问题提出了一种解决该问题的新颖等价方式,并着重说明了算法的具体实现步骤.通过MATLAB程序仿真实验验证了该思路的正确性、高效性及简单易操作性.
묘술료화력분배문제(WTA)급기수학모형,간요개소료기본의군산법,착중분석료기불족,병재이동선택책략상진행료개진,차감료유전산법중적교차、변이증가료해적다양성,탁전료수색공간,침대WTA문제제출료일충해결해문제적신영등개방식,병착중설명료산법적구체실현보취.통과MATLAB정서방진실험험증료해사로적정학성、고효성급간단역조작성.
Weapon-target assignment problem (WTA ) was described and its mathematic model was established. Ant colony algorithm (ACA) was introduced briefly; aiming at its defects, the strategy to select the next node was improved. Crossover and mutation in GAs were introduced into ACA, and the search space was opened up. A novel and equivalence method was proposed for WTA, and the steps to realize the algorithm were described in details. The simulation in MATLAB program verified the validity, efficient and simple to operate.