New ant colony optimization algorithm for the traveling salesman problem
W Gao - International Journal of Computational Intelligence …, 2020 - Springer
As one suitable optimization method implementing computational intelligence, ant colony
optimization (ACO) can be used to solve the traveling salesman problem (TSP). However …
optimization (ACO) can be used to solve the traveling salesman problem (TSP). However …
Hybrid Ant Colony Algorithm Using Improved Circle Strategy for TSP Problem
Q Li, X Dong, Q Guo - … Journal of Swarm Intelligence Research (IJSIR …, 2022 - igi-global.com
Based on the problems existing in the traditional ant colony algorithm in solving the traveling
salesman problem, a hybrid ant colony algorithm combining the improved circle strategy and …
salesman problem, a hybrid ant colony algorithm combining the improved circle strategy and …
TSP Problem Based on Artificial Ant Colony Algorithm
JZ Li, WX Liu, Y Han, HW Xing, AM Yang… - Lecture Notes in Real …, 2018 - Springer
An Artificial ant colony algorithm is a swarm intelligence optimization algorithm is advanced
and it is widely used in many fields. In this paper, the algorithm applied to the TSP problem …
and it is widely used in many fields. In this paper, the algorithm applied to the TSP problem …
An improved ant colony algorithm based on path optimization strategy for TSP
BC Gong, TY Jiang, SZ Xu, P Chen - Applied Mechanics and …, 2014 - Trans Tech Publ
Traveling salesman problem (TSP) is not only a combinatorial optimization problem but also
a classical NP-hard problem, which has high application value. Ant colony algorithm (ACA) …
a classical NP-hard problem, which has high application value. Ant colony algorithm (ACA) …
DAACO: adaptive dynamic quantity of ant ACO algorithm to solve the traveling salesman problem
H Liu, A Lee, W Lee, P Guo - Complex & Intelligent Systems, 2023 - Springer
The traveling salesman problem (TSP) is an NP-hard problem. Thus far, a large number of
researchers have proposed different ant colony optimization (ACO) algorithms to solve the …
researchers have proposed different ant colony optimization (ACO) algorithms to solve the …
Opposition-based ant colony optimization algorithm for the traveling salesman problem
Z Zhang, Z Xu, S Luan, X Li, Y Sun - Mathematics, 2020 - mdpi.com
Opposition-based learning (OBL) has been widely used to improve many swarm intelligent
optimization (SI) algorithms for continuous problems during the past few decades. When the …
optimization (SI) algorithms for continuous problems during the past few decades. When the …
[PDF][PDF] A Randomness Ant Colony Algorithm for Solving TSP
YC Niu, DY Zhang - DEStech Trans Comp Sci Eng (cnsce), 2017 - scholar.archive.org
The Travelling Salesman Problem (TSP) has received much attention because of its
practical applications in several problems. One of the commonly used algorithms to solve …
practical applications in several problems. One of the commonly used algorithms to solve …