A New Fast Ant Colony Optimization Algorithm: The Saltatory Evolution Ant Colony Optimization Algorithm

Various studies have shown that the ant colony optimization (ACO) algorithm has a good performance in approximating complex combinatorial optimization problems such as traveling salesman problem (TSP) for real-world applications. However, disadvantages such as long running time and easy stagnation s...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematics (Basel) Jg. 10; H. 6; S. 925
Hauptverfasser:	Li, Shugang, Wei, Yanfang, Liu, Xin, Zhu, He, Yu, Zhaoxu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.03.2022
Schlagworte:	ant colony algorithm Ant colony optimization Collaboration Combinatorial analysis Domains Efficiency Evolutionary algorithms Food science near-optimal path identification Optimization algorithms optimization speed Path predictors Pheromones Prediction models Quantitative analysis Traveling salesman problem Windows (intervals)
ISSN:	2227-7390, 2227-7390
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!