Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 686730, 7 pages
http://dx.doi.org/10.1155/2014/686730
Research Article

Application of Hybrid Optimization Algorithm in the Synthesis of Linear Antenna Array

1Department of Computer Engineering, Girne American University, Mersin 10, Turkey
2Department of Electrical and Electronics Engineering, Girne American University, Mersin 10, Turkey

Received 21 June 2014; Accepted 7 September 2014; Published 25 September 2014

Academic Editor: Ebrahim Momoniat

Copyright © 2014 Ezgi Deniz Ülker et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H.-K. Kim, J.-K. Chong, K.-Y. Park, and D. A. Lowther, “Differential evolution strategy for constrained global optimization and application to practical engineering problems,” IEEE Transactions on Magnetics, vol. 43, no. 4, pp. 1565–1568, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. R. J. Kuo, S. Y. Hong, and Y. C. Huang, “Integration of particle swarm optimization-based fuzzy neural network and artificial neural network for supplier selection,” Applied Mathematical Modelling, vol. 34, no. 12, pp. 3976–3990, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. E. Deniz and S. Ülker, “Clonal selection algorithm application to simple microwave matching network,” Microwave and Optical Technology Letters, vol. 53, no. 5, pp. 991–993, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. W. Geem, J. H. Kim, and G. V. Loganathan, “Harmony search optimization: application to pipe network design,” International Journal of Modelling & Simulation, vol. 22, no. 2, pp. 125–133, 2002. View at Google Scholar · View at Scopus
  5. Q.-K. Pan, M. F. Tasgetiren, P. N. Suganthan, and T. J. Chua, “A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem,” Information Sciences, vol. 181, no. 12, pp. 2455–2468, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. L. N. de Castro and F. J. von Zuben, “Learning and optimization using the clonal selection principle,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 3, pp. 239–251, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous Spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, IEEE Press, December 1995. View at Scopus
  9. D. Karaboga and B. Akay, “A comparative study of artificial Bee colony algorithm,” Applied Mathematics and Computation, vol. 214, no. 1, pp. 108–132, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001. View at Publisher · View at Google Scholar · View at Scopus
  11. R. C. Eberhart and Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '00), pp. 84–88, San Diego, Calif, USA, July 2000. View at Scopus
  12. A. S. D. Dymond, A. P. Engelbrecht, and P. S. Heyns, “The sensitivity of single objective optimization algorithm control parameter values under different computational constraints,” in Proceedings of the IEEE Congress of Evolutionary Computation (CEC ’11), pp. 1412–1419, New Orleans, LA, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Smit and A. Eiben, “Comparing parameter tuning methods for evolutionary algorithms,” in Proceedings of the IEEE Congress on Evolutionary Computing, pp. 399–406, IEEE, Trondheim, Norway, May 2009. View at Publisher · View at Google Scholar
  14. R. Thangaraj, M. Pant, A. Abraham, and P. Bouvry, “Particle swarm optimization: hybridization perspectives and experimental illustrations,” Applied Mathematics and Computation, vol. 217, no. 12, pp. 5208–5226, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and L. M. Wang, “An improved GA and a novel PSO-GA-based hybrid algorithm,” Information Processing Letters, vol. 93, no. 5, pp. 255–261, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. N. Holden and A. A. Freitas, “A hybrid particle swarm/ant colony algorithm for the classification of hierarchical biological data,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '05), pp. 100–107, IEEE, June 2005. View at Publisher · View at Google Scholar · View at Scopus
  17. H.-Q. Li and L. Li, “A novel hybrid particle swarm optimization algorithm combined with harmony search for high dimensional optimization problems,” in Proceedings of the International Conference on Intelligent Pervasive Computing (IPC '07), pp. 94–97, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. I. Paenke, J. Branke, and Y. Jin, “Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 4, pp. 405–420, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Ahrari, M. R. Saadatmand, M. Shariat-Panahi, and A. A. Atai, “On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms,” Applied Mathematics and Computation, vol. 215, no. 9, pp. 3222–3229, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  20. J. Branke, “Creating robust solutions by means of an evolutionary algorithm,” in Parallel Problem Solving from Nature-PPSN V, vol. 8, pp. 119–128, 1998. View at Google Scholar
  21. E. D. Ülker and A. Haydar, “Comparing the robustness of evolutionary algorithms on the basis of benchmark functions,” Advances in Electrical and Computer Engineering, vol. 13, no. 2, pp. 59–64, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. E. D. Ülker and A. Haydar, “A hybrid algorithm based on differential evolution, particle swarm optimization and harmony search algorithms,” in Proceedings of the Federated Conference on Computer Science and Information Systems (FedCSIS '13), pp. 417–420, September 2013. View at Scopus
  23. S. Yang, Y. B. Gan, and A. Qing, “Sideband suppression in time-modulated linear arrays by the differential evolution algorithm,” IEEE Antennas and Wireless Propagation Letters, vol. 1, pp. 173–175, 2002. View at Publisher · View at Google Scholar · View at Scopus
  24. T. B. Chen, Y. L. Dong, Y. C. Jiao, and F. S. Zhang, “Synthesis of circular antenna array using crossed particle swarm optimization algorithm,” Journal of Electromagnetic Waves and Applications, vol. 20, no. 13, pp. 1785–1795, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. K. Guney and M. Onay, “Optimal synthesis of linear antenna arrays using a harmony search algorithm,” Expert Systems with Applications, vol. 38, no. 12, pp. 15455–15462, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. C. Lin, A. Qing, and Q. Feng, “Synthesis of unequally spaced antenna arrays by using differential evolution,” IEEE Transactions on Antennas and Propagation, vol. 58, no. 8, pp. 2553–2561, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. D. G. Kurup, M. Himdi, and A. Rydberg, “Synthesis of uniform amplitude unequally spaced antenna arrays using the differential evolution algorithm,” IEEE Transactions on Antennas and Propagation, vol. 51, no. 9, pp. 2210–2217, 2003. View at Publisher · View at Google Scholar · View at Scopus
  28. Y. Chen, S. Yang, and Z. Nie, “The application of a modified differential evolution strategy to some array pattern synthesis problems,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 7, pp. 1919–1927, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. S. K. Goudos, V. Moysiadou, T. Samaras, K. Siakavara, and J. N. Sahalos, “Application of a comprehensive learning particle swarm optimizer to unequally spaced linear array synthesis with sidelobe level suppression and null control,” IEEE Antennas and Wireless Propagation Letters, vol. 9, pp. 125–129, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. M. M. Khodier and C. G. Christodoulou, “Linear array geometry synthesis with minimum sidelobe level and null control using particle swarm optimization,” IEEE Transactions on Antennas and Propagation, vol. 53, no. 8, pp. 2674–2679, 2005. View at Publisher · View at Google Scholar · View at Scopus