空战场穿越走廊基本网络规划的混合禁忌搜索算法  

Hybrid Taboo Search Algorithm of Basic Network Planning for Transit Corridor in Air Battlefield

作　　者：刘影[1] 周一叶 甘旭升[3] 杨捷 Liu Ying;Zhou Yiye;Gan Xusheng;YangJie(College of Information Engineering,Xijing University,Xi'an 710123,China;Troop No.95746 of PLA,Chengdu 611531,China;College of Air Traffic Control and Navigation,Air Force Engineering University,Xi'an 710051.China)

机构地区：[1]西京学院信息工程学院,西安710123 [2]中国人民解放军95746部队,成都611531 [3]空军工程大学空管领航学院,西安710051

出　　处：《航空工程进展》2019年第6期802-809,825,共9页Advances in Aeronautical Science and Engineering

摘　　要：不考虑限制空域的穿越走廊基本网络规划的SUMApHMP模型在求解时存在一定的难度,提出一种基于Floyd最短路径算法的混合禁忌搜索算法,用于有效管制战区空域,确保航空军事运输活动安全、高效、有序进行。根据SUMApHMP求解结果,设计不考虑限制空域的穿越走廊基本网络;利用空战场中10个机场之间的流量矩阵和距离矩阵对混合禁忌搜索算法进行测试,并将Lingo 9.0软件求解模型的优化结果与本文算法求得的结果进行比较。结果表明:提出的混合禁忌搜索算法求解时间短,求解结果正确。The solution of SUMApHMP model has a certain difficulty while not considering the transit corridor(TC)basic network in air battlefield,so a hybrid taboo search algorithm based on Floyd shortest path algorithm is proposed to control the airspace in battlefield effectively,and ensure the safe,efficient and orderly process of military transportation.According to the solution result of SUMApHMP model,the TC basic network without considering the restricted airspace is designed.The flow matrix and distance matrix between 10 airports in the air battlefield are used to test the hybrid taboo search algorithm,and the result obtained by the proposed algorithm is compared with the results optimized by Lingo 9.0 software.The results show that the proposed hybrid taboo search algorithm has short solution time and correct solution results.

关 键 词：空战场 穿越走廊 混合禁忌搜索算法 Floyd最短路径算法 基本网络 

分 类 号：V351[航空宇航科学与技术—人机与环境工程]