相遇蚁群算法在边坡非圆弧临界滑动面搜索中的应用研究

边坡非圆弧临界滑动面搜索是边坡稳定计算中的一个关键问题，其实质为安全系数最小的滑动路径搜索问题，采用效果良好的路径搜索算法--蚁群算法是目前研究的热点。为了克服传统蚁群算法效率低、效果差的缺点，基于蚂蚁正反向搜索相遇形成完整路径的原理，提出了一种相遇蚁群算法。将该算法用于边坡非圆弧滑动面搜索问题，提出了一种非圆弧临界滑动面搜索的新方法。通过2个边坡的算例计算及一个水库岸坡的工程应用，验证了新算法的有效性。计算结果表明，相遇蚁群算法无论是整个搜索范围还是从某一点起的搜索范围都要比一般蚁群算法大，所以相遇蚁群算法在搜索边坡临界滑动面时所得到解的多样性也要比一般蚁群算法好，因此，相遇蚁群算法的搜索范围能以较大的概率包含全局最优解，算法最终也能以较大概率搜索到全局最优解。最终，相遇蚁群算法可以在更大的范围内以更快的速度找到边坡的临界滑动面。

Study of applications of meeting ant colony algorithm to search non-circular critical slip surface of slope

The search of non-circular critical slip surface is a key problem in slope stability analysis. Essentially, this problem is a path search problem; so the ant colony algorithm is a very suitable method to solve this problem. To overcome the shortcomings of traditional ant colony algorithm, from the principle of combing one whole road by forward and reverse search of ants, here a new algorithm, meeting ant colony algorithm, is proposed. And then this meeting ant colony algorithm is used to locate the critical slip surface of slopes. Through two typical examples and an engineering application of a reservoir bank slope, the effectiveness of the new algorithm is verified. The results show that, from not only the whole search scope but also one point search scope, the meeting ant colony algorithm are all better than traditional ant colony algorithm; so the solutions diversity to search the critical slip surface of slopes by meeting ant colony algorithm is better. And then, to meeting ant colony algorithm, the global optimal solution can be included in the search scope by the larger probability; and the global optimal solution can be obtained by the larger probability. At last, by meeting ant colony algorithm, the critical slip surface of slopes can be found on larger scope and by larger speed.