A Modified ACO Algorithm for the Pattern Synthesis of Array Antennas
In order to solve the array antenna pattern problem, a modified ACO algorithm is proposed. The standard ant colony optimization algorithm has the drawbacks of easily trapping in local optimum and difficult to optimize continuous function. In the modified algorithm, discordant encoding to variable and optimization in vicinity are employed, and results in improvement of the search ability and not easily trapping in local optimum. Computer simulation shows that the algorithm may obtain good results.
Keywordsarray antenna pattern ACO local optimum optimization in vicinity
Unable to display preview. Download preview PDF.
- 1.Zhao, R.-F., Tan, Z.-H., Jiang, H.-L.: Smart Antennas for Wireless Systems. Chinese Journal of Electronics 28(12), 78–80 (2000)Google Scholar
- 2.Mailloux, R.J.: Phased Array Antenna Handbook, pp. 88–98. Publishing House Of Electronics Industry, Beijing (2006)Google Scholar
- 3.Colomi, A., Dorigo, M., Maniezzo, V., et al.: Distributed optimization by ant colonies. In: Proceedings of European Conference on Artificial Life, pp. 134–142 (1991)Google Scholar
- 6.Duan, H.-B.: Ant Colony Algorithms Theory and Applications, pp. 24–42. Science Press, Beijing (2005)Google Scholar