One of the obstacles in applying ant colony optimization (ACO) to the combinatorial optimization is that the search process is sometimes biased by algorithm features such as the pheromone model and the solution construction process. Due to such searching bias, ant colony optimization cannot converge to the optimal solution for some problems. In this paper, we define a new type of searching bias in ACO named feedback bias taking the k-cardinality tree problem as the test instance. We also present a method for avoiding the feedback searching bias. Convergence analysis of our method is also given. Experimental results confirm the correctness of our analysis and show that our method can effectively avoid the searching bias and can ensure the convergence for the problem. © 2012 Springer-Verlag.
CITATION STYLE
Chen, B., & Chen, L. (2012). A method for avoiding the feedback searching bias in ant colony optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 206–216). https://doi.org/10.1007/978-3-642-30976-2_25
Mendeley helps you to discover research relevant for your work.