U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem
Explore this paper's citation graph
- Type
- article
- Published
- 2018-12-01
- Cited by
- 8
- References
- 4
- Access
- Open access
- OpenAlex
- https://openalex.org/W4245157707
Keywords
Travelling salesman problem, Ant colony optimization algorithms, Parallel metaheuristic, Ant colony, Mathematical optimization
References
Cited by
- Comparative study between elephant herding optimization (EHO) and U-turning ant colony optimization (U-TACO) in solving symmetric traveling salesman problem (STSP)
- Taxonomy of bio-inspired optimization algorithms
- Historical survey on metaheuristics algorithms
- Bat algorithm (BA): review, applications and modifications
- A comparative study of particle swarm optimization and genetic algorithm
- The novel Social Spider Optimization Algorithm: Overview, Modifications, and Applications
- Smart Agent and it’s effect on Artificial Intelligence : A Review Study
Related papers
- MAX-MIN Ant System and local search for the traveling salesman problem
- Performance comparison of sequential and parallel execution of the Ant Colony Optimization algorithm for solving the traveling salesman problem
- An ant system with two colonies and its application to Traveling Salesman Problem
- Solution of Travelling Salesman Problem Using Ant Colony Algorithm
- An Ant Colony System Hybridized with Randomized Algorithm for TSP
- A new method for handling the traveling salesman problem based on parallelized genetic ant colony systems
- Improvements on the Ant-System: Introducing the MAX-MIN Ant System
- Hybrid ant colony and particle swarm algorithm for solving TSP