Ant algorithms for discrete optimization
Artificial Life
Modeling the dynamics of ant colony optimization
Evolutionary Computation
Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem
IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
We demonstrate a novel Ant Colony System with dynamically varied parameters and a penalty-reward function, which is based on the Basic Ant System (BAS) algorithm, also presented is its application to solving complex TSP problem. Our new algorithm has two important features, the first: a perturbation factor formulated by inverse exponent penalty-reward function is developed; the second: a corresponding transition strategy with random selection is designed. Numerical simulation demonstrates that our new algorithm has much higher convergence speed and stability than BAS algorithm, and brings along good effects of reducing CPU time, and preventing search from being in stagnation behavior.