A Graph-based Ant system and its convergence
Future Generation Computer Systems
Modeling the dynamics of ant colony optimization
Evolutionary Computation
When Model Bias Is Stronger than Selection Pressure
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Modelling ACO: Composed Permutation Problems
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Structural advantages for ant colony optimisation inherent in permutation scheduling problems
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Ant colony optimization theory: a survey
Theoretical Computer Science
Solution bias in ant colony optimisation: Lessons for selecting pheromone models
Computers and Operations Research
A novel ant clustering algorithm based on cellular automata
Web Intelligence and Agent Systems
Text feature selection using ant colony optimization
Expert Systems with Applications: An International Journal
Using Ant Colony Optimization algorithm for solving project management problems
Expert Systems with Applications: An International Journal
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A pheromone-rate-based analysis on the convergence time of ACO algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Spatial pattern growth and emergent animat segregation
Web Intelligence and Agent Systems
Text-independent speaker verification using ant colony optimization-based selected features
Expert Systems with Applications: An International Journal
A dynamic max-min ant system for solving the travelling salesman problem
International Journal of Bio-Inspired Computation
Computers and Operations Research
Ant colony algorithm for traffic signal timing optimization
Advances in Engineering Software
IEEE Computational Intelligence Magazine
Search bias in ant colony optimization: on the role of competition-balanced systems
IEEE Transactions on Evolutionary Computation
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Ant colony optimization ACO, an intelligential optimization algorithm, has been widely used to solve combinational optimization problems. One of the obstacles in applying ACO is that its search process is sometimes biased by algorithm features such as the pheromone model and the method of constructing the solutions. Due to such searching bias, ant colony optimization cannot converge to the optimal solutions of deceptive problems. The goal of our study is to find an effective method to avoid such searching bias and to achieve high performance of ACO on deceptive problems. In this paper, we present a method for avoiding the searching bias in the first order deceptive problem of ACO taking the n-bit trap problem as an instance. Convergence analysis of our method is also given. Our experimental results confirm the correctness of our theoretical analysis and show that our method can effectively avoid the searching bias and can ensure both the convergence in value and the convergence in solution for the first order deceptive problems.