Memory Interval Ant Colony Optimization Algorithm and Its Simulation
LIU Zhen
WANG Yajiao
Abstract：Aiming at the drawback of the traditional ACO,an interval probability ant colony algorithm inspired by the charac?teristic of human’s memory is proposed. The pheromone of the path in the ACO can be extend to the interval bound,and then the probability for the selection of the path can be set as the interval probability,which can expand the diversity of ACO in the path se?lection. The updating of pheromone can be performing according to the way of human＇s memory,and different path can be updated according to the long-term memory updating and short-term memory way within the sub-optimal path. The proposed algorithm can reach the satisfactory solution set through the convergence analysis. Lots of simulation results for path planning problem show that the proposed algorithm performs well than other algorithms.
Keywords：ant colony optimizationinterval probabilityartificial memoryconvergence
Publication Date：2019-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 27-31,44 )