Table of Contents Author Guidelines Submit a Manuscript
International Journal of Antennas and Propagation
Volume 2016, Article ID 5359298, 11 pages
http://dx.doi.org/10.1155/2016/5359298
Research Article

Design of Large Thinned Arrays Using Different Biogeography-Based Optimization Migration Models

1Department of Physics, Aristotle University of Thessaloniki, Thessaloniki, Greece
2Department of Electrical and Computer Engineering, University of Nicosia, Nicosia, Cyprus

Received 6 May 2016; Revised 29 July 2016; Accepted 10 August 2016

Academic Editor: Ikmo Park

Copyright © 2016 Sotirios K. Goudos and John N. Sahalos. 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. R. Jain and G. S. Mani, “Solving ‘antenna array thinning problem’ using genetic algorithm,” Applied Computational Intelligence and Soft Computing, vol. 2012, Article ID 946398, 14 pages, 2012. View at Publisher · View at Google Scholar
  2. R. L. Haupt, “Thinned arrays using genetic algorithms,” IEEE Transactions on Antennas and Propagation, vol. 42, no. 7, pp. 993–999, 1994. View at Publisher · View at Google Scholar · View at Scopus
  3. N. Jin and Y. Rahmat-Samii, “Advances in particle swarm optimization for antenna designs: real-number, binary, single-objective and multiobjective implementations,” IEEE Transactions on Antennas and Propagation, vol. 55, no. 3 I, pp. 556–567, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. Ó. Quevedo-Teruel and E. Rajo-Iglesias, “Ant colony optimization in thinned array synthesis with minimum sidelobe level,” IEEE Antennas and Wireless Propagation Letters, vol. 5, no. 1, pp. 349–352, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, pp. 4104–4108, IEEE, Orlando, Fla, USA, 1997. View at Publisher · View at Google Scholar
  6. S. Mirjalili and A. Lewis, “S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization,” Swarm and Evolutionary Computation, vol. 9, pp. 1–14, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Storn and K. Price, “Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces,” 1995, http://citeseer.ist.psu.edu/article/storn95differential.html.
  8. 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 MathSciNet
  9. R. S. Rahnamayan, H. R. Tizhoosh, and M. M. A. Salama, “Opposition-based differential evolution,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 1, pp. 64–79, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. H. R. Tizhoosh, “Opposition-based learning: a new scheme for machine intelligence,” in Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation (CIMCA '05) and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (IAWTIC '05), vol. 1, pp. 695–701, Vienna, Austria, November 2005. View at Scopus
  11. 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
  12. S.-H. Yang and J.-F. Kiang, “Optimization of sparse linear arrays using harmony search algorithms,” IEEE Transactions on Antennas and Propagation, vol. 63, no. 11, pp. 4732–4738, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. 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
  14. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 1, pp. 29–41, 1996. View at Publisher · View at Google Scholar · View at Scopus
  15. E. Rajo-lglesias and Ó. Quevedo-Teruel, “Linear array synthesis using an ant-colony-optimization-based algorithm,” IEEE Antennas and Propagation Magazine, vol. 49, no. 2, pp. 70–79, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Simon, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 6, pp. 702–713, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Ma, “An analysis of the equilibrium of migration models for biogeography-based optimization,” Information Sciences, vol. 180, no. 18, pp. 3444–3464, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. W. Guo, L. Wang, and Q. Wu, “An analysis of the migration rates for biogeography-based optimization,” Information Sciences, vol. 254, pp. 111–140, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. U. Singh, H. Kumar, and T. S. Kamal, “Design of Yagi-Uda antenna using biogeography based optimization,” IEEE Transactions on Antennas and Propagation, vol. 58, no. 10, pp. 3375–3379, 2010. View at Publisher · View at Google Scholar · View at Scopus
  20. M. R. Lohokare, S. S. Pattnaik, S. Devi, K. M. Bakwad, and J. G. Joshi, “Parameter calculation of rectangular microstrip antenna using biogeography-based optimization,” in Proceedings of the Applied Electromagnetics Conference (AEMC '09), pp. 1–4, Kolkata, India, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. M. R. Lohokare, S. S. Pattnaik, S. Devi, B. K. Panigrahi, K. M. Bakwad, and J. G. Joshi, “Modified BBO and calculation of resonant frequency of circular microstrip antenna,” in Proceedings of the World Congress on Nature and Biologically Inspired Computing (NABIC '09), pp. 487–492, IEEE, Coimbatore, India, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. U. Singh, H. Kumar, and T. S. Kamal, “Linear array synthesis using biogeography based optimization,” Progress in Electromagnetics Research M, vol. 11, pp. 25–36, 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Sharaqa and N. Dib, “Design of linear and circular antenna arrays using biogeography based optimization,” in Proceedings of the 2011 1st IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT '11), pp. 1–6, Amman, Jordan, December 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. S. K. Goudos, K. B. Baltzis, K. Siakavara, T. Samaras, E. Vafiadis, and J. N. Sahalos, “Reducing the number of elements in linear arrays using biogeography-based optimization,” in Proceedings of the 6th European Conference on Antennas and Propagation (EuCAP '12), pp. 1615–1618, Prague, Czech Republic, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Dorigo and L. M. Gambardella, “Ant colonies for the travelling salesman problem,” BioSystems, vol. 43, no. 2, pp. 73–81, 1997. View at Publisher · View at Google Scholar · View at Scopus
  26. M. Dorigo and T. Stutzle, Ant Colony Optimization, The MIT Press, Cambridge, Mass, USA, 2004.
  27. E. Mezura-Montes, J. Velázquez-Reyes, and C. A. Coello Coello, “A comparative study of differential evolution variants for global optimization,” in Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO '06), pp. 485–492, Seattle, Wash, USA, July 2006. View at Scopus
  28. J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 3, pp. 281–295, 2006. View at Publisher · View at Google Scholar · View at Scopus
  29. S. García, A. Fernández, J. Luengo, and F. Herrera, “Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power,” Information Sciences, vol. 180, no. 10, pp. 2044–2064, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. H. Ma, D. Simon, M. Fei, and Z. Chen, “On the equivalences and differences of evolutionary algorithms,” Engineering Applications of Artificial Intelligence, vol. 26, no. 10, pp. 2397–2407, 2013. View at Publisher · View at Google Scholar · View at Scopus
  31. J. Arabas, A. Szczepankiewicz, and T. Wroniak, “Experimental comparison of methods to handle boundary constraints in differential evolution,” in Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11–15, 2010, Proceedings, Part II, R. Schaefer, C. Cotta, J. Kołodziej, and G. Rudolph, Eds., pp. 411–420, Springer, Berlin, Germany, 2010. View at Google Scholar
  32. E. Juarez-Castillo, N. Perez-Castro, and E. Mezura-Montes, “A novel boundary constraint-handling technique for constrained numerical optimization problems,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '15), pp. 2034–2041, Sendai, Japan, May 2015. View at Publisher · View at Google Scholar