Ant algorithms for discrete optimization
Artificial Life
Using Genetic Algorithms to Optimize ACS-TSP
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant Colony Optimization
A novel ACO algorithm with adaptive parameter
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Hi-index | 0.04 |
Ant colony optimization (ACO) has been proved to be one of the best performing algorithms for NP-hard problems as TSP. The volatility rate of pheromone trail is one of the main parameters in ACO algorithms. It is usually set experimentally in the literatures for the application of ACO. The present paper proposes an adaptive strategy for the volatility rate of pheromone trail according to the quality of the solutions found by artificial ants. The strategy is combined with the setting of other parameters to form a new ACO algorithm. Finally, the experimental results of computing traveling salesman problems indicate that the proposed algorithm is more effective than other ant methods.