To deal with the assumptions in basic ant colony optimization (ACO) algorithm that the velocities of ants are infinite and pheromones of ants are updated synchronously, an improved ACO algorithm based on asynchronous update of pheromone is proposed.

• 针对基本蚁群算法中蚂蚁速度无限且信息素同步更新的假定前提,提出一种基于信息素异步更新的改进蚁群算法。