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

为有效管制战区空域,确保航空军事运输活动安全、高效、有序进行,针对不考虑限制空域的穿越走廊基本网络规划问题,构建了SUMApHMP数学模型,并结合Floyd最短路径算法提出了一种求解该模型的混合禁忌搜索算法,进而根据SUMApHMP求解结果设计了不考虑限制空域的穿越走廊基本网络。利用空战场中10个机场之间的流量矩阵和距离矩阵对混合禁忌算法进行了测试,并将Lingo 9.0软件对模型的优化结果与本文算法求得的结果进行了比较,验证了算法的可行性和有效性。

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

In order to effectively control the theater airspace for ensuring the safe, efficient and orderly operation of aviation military transportation activities, the SUMApHMP mathematical model is constructed for the planning of Transit Corridor (TC) basic network without considering the restricted airspace, and a hybrid taboo search algorithm combined with Floyd shortest path algorithm is proposed for solving the model, and then TC basic network without considering the restricted airspace is designed according to the solution result of SUMApHMP. The hybrid taboo search algorithm is tested by flight flow matrix and distance matrix between 10 airports in the air battlefield, and the result obtained by the proposed algorithm is compared with the results optimized using Lingo 9.0 software, validating the feasibility and effectiveness of the algorithm.