A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Bioinspiration & biomimetics Ročník 9; číslo 3; s. 036006
Hlavní autori: Zhang, Zili, Gao, Chao, Liu, Yuxin, Qian, Tao
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: England 01.09.2014
Predmet:
Algorithms
Animals
Ants - physiology
Behavior, Animal - physiology
Biomimetics - methods
Computer Simulation
Game Theory
Models, Biological
Numerical Analysis, Computer-Assisted
Physarum polycephalum - physiology
ISSN:1748-3190, 1748-3190
On-line prístup:Zistit podrobnosti o prístupe
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1748-3190
1748-3190
DOI:10.1088/1748-3182/9/3/036006