Improved clonal selection algorithm combined with ant colony optimization

36Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Both the clonal selection algorithm (CSA) and the ant colony optimization (ACO) are inspired by natural phenomena and are effective tools for solving complex problems. CSA can exploit and explore the solution space parallely and effectively. However, it can not use enough environment feedback information and thus has to do a large redundancy repeat during search. On the other hand, ACO is based on the concept of indirect cooperative foraging process via secreting pheromones. Its positive feedback ability is nice but its convergence speed is slow because of the little initial pheromones. In this paper, we propose a pheromone-linker to combine these two algorithms. The proposed hybrid clonal selection and ant colony optimization (CSA-ACO) reasonably utilizes the superiorities of both algorithms and also overcomes their inherent disadvantages. Simulation results based on the traveling salesman problems have demonstrated the merit of the proposed algorithm over some traditional techniques. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Gao, S., Wang, W., Dai, H., Li, F., & Tang, Z. (2008). Improved clonal selection algorithm combined with ant colony optimization. IEICE Transactions on Information and Systems, E91-D(6), 1813–1823. https://doi.org/10.1093/ietisy/e91-d.6.1813

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free