Solving NP-Hard Problems with Physarum-Based Ant Colony System.
NP-hard problems exist in many real world applications. Ant colony optimization (ACO) algorithms can provide approximate solutions for those NP-hard problems, but the performance of ACO algorithms is significantly reduced due to premature convergence and weak robustness, etc. With these observations in mind, this paper proposes a Physarum-based pheromone matrix optimization strategy in ant colony system (ACS) for solving NP-hard problems such as traveling salesman problem (TSP) and 0/1 knapsack problem (0/1 KP). In the Physarum-inspired mathematical model, one of the unique characteristics is that critical tubes can be reserved in the process of network evolution. The optimized updating strategy employs the unique feature and accelerates the positive feedback process in ACS, which contributes to the quick convergence of the optimal solution. Some experiments were conducted using both benchmark and real datasets. The experimental results show that the optimized ACS outperforms other meta-heuristic algorithms in accuracy and robustness for solving TSPs. Meanwhile, the convergence rate and robustness for solving 0/1 KPs are better than those of classical ACS.
Yuxin
Y
Liu
Chao
C
Gao
Zili
Z
Zhang
Yuxiao
Y
Lu
Shi
S
Chen
Mingxin
M
Liang
Li
L
Tao
D000465:Algorithms; D000818:Animals; D001000:Ants / Q000502:physiology*; D032701:Biomimetics / Q000379:methods*; D003198:Computer Simulation; D003661:Decision Support Techniques; D008954:Models, Biological; D015233:Models, Statistical; D010675:Pheromones / Q000378:metabolism*; D010804:Physarum / Q000502:physiology*
D010675:Pheromones