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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 10; no. 6; p. 925
Main Authors:	Li, Shugang, Wei, Yanfang, Liu, Xin, Zhu, He, Yu, Zhaoxu
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.03.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!