武警部队开进路线问题的蚂蚁算法研究

部队开进路线问题是类似于TSP的NP问题。本文将蚂蚁算法应用于部队开进路线问题中，在综合考量每条路径的通行条件、隐蔽性、迂回道路数量基础上，通过层次分析法求出每条路径的权值，进而运用蚂蚁算法原理对问题设计算法。算法用Delphi实现，通过对实际部队开进路线问题的测试，得到较好结果。相对于传统的经验选择路径方法，此方法更少依赖选择主体的主观性，从而更具客观性与可重复性。

Research on the Ant Algorithm of the Route Optimization Problem of CAPF

Route optimization problem of CAPF is a NP problem which is similar to TSP. On the basis of considering various factors such as the traffic, hidden property and the number of zig - zag routes of every route, the weight is determined by using analytical hierarchy process. Then a new algorithm according to the theory of ant colony optimization is designed to solve the problem and is realized by Delphi. Experiment proves the validity, objectivity and repeatability of the algorithm.