title: A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model.
abstract: Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP.
authors.affiliation: School of Computer and Information Science, Southwest University, Chongqing 400715, People's Republic of China. School of Information Technology, Deakin University, 3217, Australia.
authors.forename: Zili
authors.initials: Z
authors.lastname: Zhang
authors.forename: Chao
authors.initials: C
authors.lastname: Gao
authors.forename: Yuxin
authors.initials: Y
authors.lastname: Liu
authors.forename: Tao
authors.initials: T
authors.lastname: Qian
mesh_terms: D000465:Algorithms; D000818:Animals; D001000:Ants / Q000502:physiology*; D001522:Behavior, Animal / Q000502:physiology*; D032701:Biomimetics / Q000379:methods*; D003198:Computer Simulation; D005716:Game Theory; D008954:Models, Biological; D009716:Numerical Analysis, Computer-Assisted; D016839:Physarum polycephalum / Q000502:physiology*