Cited By
View all- Peterson GMayer CCousin K(2011)WoLF Ant2011 IEEE Congress of Evolutionary Computation (CEC)10.1109/CEC.2011.5949726(995-1002)Online publication date: Jun-2011
The Traveling Salesman Problem (TSP) is one of the standard test problems used in performance analysis of discrete optimization algorithms. The Ant Colony Optimization (ACO) algorithm appears among heuristic algorithms used for solving discrete ...
This paper presents a novel two-stage hybrid swarm intelligence optimization algorithm called GA---PSO---ACO algorithm that combines the evolution ideas of the genetic algorithms, particle swarm optimization and ant colony optimization based on the ...
The travelling salesman problem (TSP) is a classic problem of combinatorial optimization and is unlikely to find an efficient algorithm for solving TSPs directly In the last two decades, ant colony optimization (ACO) has been successfully used to solve ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in