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 missi...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.展开更多
Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algori...Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest,best,most economical,and so on. The paper uses an example of SA algorithm validation to verify it,and the method is proved to be feasible.展开更多
基金supported by the National Aviation Science Foundation of China(20090196002)
摘要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.
基金National Natural Science Foundation of China(No.50574037)Henan Soft Science Research Project(No.102400410033No.102400410032)
摘要Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest,best,most economical,and so on. The paper uses an example of SA algorithm validation to verify it,and the method is proved to be feasible.