Ant algorithms for discrete optimization
Artificial Life
A Multilevel Approach to the Travelling Salesman Problem
Operations Research
Ant Colony Optimization
Solving the mesh-partitioning problem with an ant-colony algorithm
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An improved ant colony algorithm and simulation
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Two-stage updating pheromone for invariant ant colony optimization algorithm
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this paper, a multilevel approach of Ant Colony Optimization to solve the Traveling Salesman Problem is introduced. The basic idea is to split the heuristic search performed by ants into two stages; in this case we use both the Ant System and Ant Colony System algorithms. Also, the effect of using local search was analyzed. We have studied the performance of this new algorithm for several Traveling Salesman Problem instances. Experimental results obtained conclude that the Two-Stage approach significantly improves the Ant System and Ant Colony System in terms of the computation time needed.