Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Synthesis of unequally-spaced linear array using modified central force optimisation algorithm

© The Institution of Engineering and Technology
Received 13/12/2015, Accepted 13/04/2016, Revised 21/03/2016, Published 18/07/2016

In this study, a modified version of the central force optimisation (MCFO) algorithm is presented. This modified version is based on the idea of combining the ability of social thinking in particle swarm optimisation (PSO) with the search capability of the original CFO, along with the addition of time-varying acceleration coefficients, to effectively control the global search and enhance the CFO convergence capability. The convergence capability of the MCFO approach is compared with that of other recent evolutionary-based algorithms, using 12 benchmark functions grouped into unimodal and multimodal functions. Furthermore, the MCFO algorithm is considered for the synthesis of unequally-spaced linear arrays with minimum sidelobe levels and/or null placement in certain directions as well as a specified maximum null-to-null beamwidth. The comparison of the simulations of different algorithms shows that the MCFO technique is superior to other evolutionary algorithms such as the genetic algorithm, ant colony optimisation, PSO algorithm, and gravitational search algorithm, as well as other improved CFO algorithms.

Inspec keywords: search problems; antenna radiation patterns; particle swarm optimisation; linear antenna arrays

Other keywords: minimum sidelobe level; CFO convergence capability enhancement; multimodal function; particle swarm optimisation; time-varying acceleration coefficients; maximum null-to-null beamwidth; antenna array pattern synthesis; unequally-spaced linear array synthesis; unimodal function; modified central force optimisation algorithm; PSO algorithm; null placement; unequally-spaced linear; MCFO algorithm; global search control

Subjects: Optimisation techniques; Combinatorial mathematics; Antenna arrays

References

    1. 1)
    2. 2)
      • 28. Kennedy, J., Eberhart, R.: ‘Particle swarm optimization’. IEEE Int. Conf. on Neural Networks, Perth, Australia, 1995, vol. 4, pp. 1942–1948.
    3. 3)
    4. 4)
      • 22. Formato, R.A.: ‘Central force optimization with variable initial probes and adaptive decision space’, Appl. Math. Comput., 2011, 217, (21), pp. 8866–8872.
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
      • 25. Jie, L., Wang, Y.: ‘An improved central force optimization algorithm for multimodal optimization’, J. Appl. Math., 2014, 2014, (12), pp. 1–12.
    15. 15)
    16. 16)
    17. 17)
      • 24. Ding, D., Qi, D., Luo, X., et al: ‘Convergence analysis and performance of an extended central force optimization algorithm’, Appl. Math. Comput., 2012, 219, (4), pp. 2246–2259.
    18. 18)
    19. 19)
      • 31. Mirjalili, S., Hashim, S.Z.M.: ‘A new hybrid PSOGSA algorithm for function optimization’. Int. Conf. on computer and information application (ICCIA 2010), 2010, pp. 374–377.
    20. 20)
      • 26. Weiyi, Q., Wang, B., Feng, Z.: ‘Adaptive central force optimization algorithm based on the stability analysis’, Math. Probl. Eng., 2015, 2015, (2015), pp. 1–10.
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
    27. 27)
    28. 28)
    29. 29)
      • 1. Mailloux, R.J.: ‘Phased array antenna handbook’ (Artech House, Boston, 2005, 2nd edn.).
    30. 30)
    31. 31)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-map.2015.0801
Loading

Related content

content/journals/10.1049/iet-map.2015.0801
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address