求解连续函数最大值的蚂蚁优化算法

Solving the Maximization Problem of the Continuous Functions Based on Ant Optimization Algorithm

求解连续函数最大值的优化算法已有多种,但都不同程度地存在一定的局限性.为此,提出了一种用于求解连续函数最大值的蚂蚁优化算法—基于图的蚂蚁算法.该方法将问题抽象为一个有向图,模拟蚂蚁的觅食行为,由一组蚂蚁反复地在有向图上移动,最终得到最优解.在阐述了该算法的具体步骤后,从理论上对该算法的收敛性进行了分析,证明了该算法可较快地收敛到最优解.

Many ways have been given to solve the maximization problem of the continuous function, however, there are some drawbacks more or less. So, an ant optimization algorithm-GBAS（ Graph-Based Ant System） is proposed, in which the problem is firstly abstracted as a directed graph, a group of ants then traverse on the directed graph repeatedly simulating the behavior of foraging, and the optimization solution can be obtained in the end. The procedure of the algorithm is described in detail and its convergence is analyzed theoretically, and thus this algorithm is proved to converge to the optimization solution rapidly.