基于蚁群算法和禁忌搜索的部队机动路径选择  

Maneuver routing selection based on ant colony algorithm and tabu search method

作　　者：刘卫东[1] 刘顺成[1] 杨萍[1] 贾凯[1] 

机构地区：[1]解放军第二炮兵工程学院,陕西西安710025

出　　处：《系统工程与电子技术》2008年第8期1505-1508,共4页Systems Engineering and Electronics

基　　金：军队科研项目(EP040049)资助课题

摘　　要：新形势下的部队作战规划对机动路径选择这个问题提出了新要求,需要同时达到机动时效和机动分散的双重指标。针对问题建立了数学模型,引入信息熵理论作为目标评价准则,借助改进的蚁群算法和禁忌搜索算法相结合的启发式方法对问题进行求解,给出了该方法的具体计算步骤。对仿真结果的分析表明,算法是切实有效的。To meet the new requirements for maneuver routing selection under the new situation, the ma- neuvering time limitation and maneuvering decentralization both are simultaneously requested to come up. The mathematical model of the question is built, and the information entropy theory is quoted as the assessment rule. The heuristic method combining the improved ant colony algorithm with the tabu search algorithm is ap- plied to solve the question, and the specific processing steps are also given. By the analysis of the simulation resuits, the algorithm is proved to be effective.

关 键 词：机动路径选择 蚁群算法 禁忌搜索 信息熵 

分 类 号：O224[理学—运筹学与控制论] TP391.9[理学—数学]