Solving algorithm for TA optimization model based on ACO-SA |
| |
| Authors: | Jun Wang Xiao guang Gao Yong wen Zhu |
| |
| Institution: | 1. School of Electronic and Information Technology, Northwestern Polytechnical University, Xi'an 710072, P. R. China;
2. Radar and EW Institute, Equipment Academy of Air Force, Beijing 100085, P. R. China |
| |
| Abstract: | An ant colony optimization (ACO)-simulated annealing (SA)-based algorithm is developed for the target assignment problem (TAP) in the air defense (AD) command and control (C2)system of surface to air missile (SAM) tactical unit.The accomplishment process of target assignment (TA) task is analyzed.A firing advantage degree (FAD) concept of fire unit (FU) intercepting targets is put forward and its evaluation model is established by using a linear weighted synthetic method.A TA optimization model is presented and its solving algorithms are designed respectively based on ACO and SA.A hybrid optimization strategy is presented and developed synthesizing the merits of AcO and SA.The simulation examples show that the model and algorithms can meet the solving requirement of TAP in AD combat. |
| |
| Keywords: | target assignment (TA) optimization ant colony optimization (ACO) algorithm simulated annealing (SA) algorithm hybrid optimization strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
