Non-Linearly Weighted Pheromone Updating for Ant Colony Optimization

Ying-Han Qiu, Qiang Yang, Jian-Yu Li, Ya-Hui Jia, Zi-Jia Wang, Xu-Dong Gao, Zhenyu Lu, Jun Zhang

Abstract: Ant Colony Optimization (ACO) has witnessed great success in tackling the Traveling Salesman Problem (TSP). In ACO, ants involved in the pheromone update play pivotal roles in its optimization effectiveness. Along this road, this paper designs an ant selection mechanism along with a non-linear weight method for ACO to update the pheromone effectively, leading to a novel ACO, called NLW-ACO. Particularly, NLW-ACO leverages the fitness values of ants to assign each ant a selection probability. Then, it adaptively chooses ants for pheromone update. Subsequently, a nonlinear weight is assigned to each selected ant based on its fitness value to update the pheromone matrix. Resultantly, better ants have higher selection probabilities and larger weights to take part in the pheromone update. This leads to that NLW-ACO compromises search convergence and search diversity appropriately to seek for the optimum. Experiments have been carried out on 10 TSP instances of diverse scales. The experimental findings substantiate that NLW-ACO significantly outperforms the 5 typical ACO methods, especially on large-scale TSP problems.