Evolutionary Algorithms Applied to Antennas and Propagation: Emerging Trends and Applications 2017View this Special Issue
Research Article | Open Access
Geng Sun, Yanheng Liu, Han Li, Shuang Liang, Aimin Wang, Boyu Li, "An Antenna Array Sidelobe Level Reduction Approach through Invasive Weed Optimization", International Journal of Antennas and Propagation, vol. 2018, Article ID 4867851, 16 pages, 2018. https://doi.org/10.1155/2018/4867851
An Antenna Array Sidelobe Level Reduction Approach through Invasive Weed Optimization
The problems of synthesizing the beam patterns of the linear antenna array (LAA) and the circular antenna array (CAA) are addressed. First, an optimization problem is formulated for reducing the maximum sidelobe level (SLL) of the beam patterns. Then, the formulated problem is solved by using the invasive weed optimization (IWO) algorithm. Various simulations are performed to evaluate the effectiveness of the IWO algorithm for the synthesis of the beam patterns of the LAA and the CAA. The results show that IWO has a better performance in terms of the accuracy, the convergence rate, and the stability compared with other algorithms for the SLL reductions. Moreover, the electromagnetic simulation results also show that IWO achieves the best performance for the beam pattern synthesis of the antenna arrays in practical conditions.
With the rapid development of the communication technologies and the explosive growth of the number of users, the capacity of a communication system has bottlenecks . Usage of the antenna arrays can improve the capacity and the spectral efficiency of a wireless communication system [2, 3]. For example, the fifth generation (5G) communications adopt the millimeter wave (mm-wave) and beamforming technologies based on antenna arrays, to improve the spectral efficiency and communication rate of the system . Moreover, the energy efficiency of a communication system can be enhanced by using the antenna arrays .
Beam pattern characteristic is one of the most important properties of an antenna array . A directional mainlobe with the low sidelobe level (SLL) of the beam pattern will effectively enhance the communication quality and reduce the interferences [7, 8]. Thus, synthesizing the beam pattern of an antenna array is very important. The classical synthesis methods for antenna arrays, such as the perturbation methods , are used to optimize the beam patterns, but it requires considerable work and rich debugging experiences. Thus, practicing this method is not reliable. Moreover, existing array-weighting optimization schemes, for example, the Dolph-Chebyshev  and the Taylor  approaches, have already been tested experimentally to be an effective method to solve the beam pattern optimization problems. However, these approaches are only suitable for synthesizing the antenna arrays with less numbers of antenna elements. In addition, there are strict restrictions for using such approaches.
Swarm intelligence and evolutionary algorithms are efficient methods for the beam pattern synthesis of the antenna arrays. These algorithms are suitable for solving large-scale antenna array synthesis problems since they do not require any restrictions on antenna arrays. Todnatee and Phongcharoenpanich  use a method based on genetic algorithm (GA) to synthesize the radiation pattern of a nonuniform linear antenna array (LAA), and a maximum SLL of −20 dB can be achieved by the proposed method. Chakravarthy and Rao  propose to use a particle swarm optimization- (PSO-) based algorithm to synthesize the beam pattern of a circular antenna array (CAA). Reference  also uses PSO as the optimizer to synthesize the pencil beam pattern of the time-modulated concentric circular antenna array (CCAA). Sharaqa and Dib  optimize the beam patterns of the CAA and the CCAA by using the firefly algorithm (FA); the excitation currents and the spacing between the elements are jointly optimized for reducing the maximum SLL. Singh and Salgotra  use the flower pollination algorithm (FPA) to determine the excitation currents of a LAA for reducing the maximum SLL and controlling the nulls. Li et al.  utilize a biogeography-based optimization (BBO) algorithm to suppress the maximum SLL of the LAA and CAA. Reference  also uses a BBO-based method to reduce the maximum SLL as well as to achieve the deep nulls. Saxena and Kothari  optimize the beam pattern of the LAA by using the grey wolf optimization (GWO) algorithm. Sun et al.  adopt a strategy based on cuckoo search (CS) algorithm to suppress the maximum SLL of the CCAA. The authors in  also use a CS-based algorithm to synthesize the beam patterns of a large-scale planar antenna array (PAA). Reference  utilizes the social network optimization (SNO) algorithm to design the PAA, and the results are compared with the stud genetic algorithm. Saxena and Kothari  use the ant lion optimization (ALO) to suppress the maximum SLL and to control the deep nulls of the LAA. In reference , a hybrid approach called particle swarm optimization and gravitational search algorithm-explore (PSOGSA-E) is proposed to reduce the maximum SLL of the random antenna array. Reference  uses the binary spider monkey optimization algorithm to design the work status of each element of the CCAA for achieving a lower maximum SLL.
In this paper, the invasive weed optimization (IWO)  is employed to solve the beam pattern synthesis problems of the LAA and the CAA for reducing the maximum SLL. First, we formulate a beam pattern optimization problem for reducing the maximum SLLs of the LAA and the CAA. Second, we use the IWO algorithm to solve the formulated problem. Then, the key parameters of the IWO algorithm are tuned to achieve better performance for synthesizing the beam patterns. Finally, we conduct simulations based on different numbers of antenna elements for the LAA and the CAA, respectively, to verify the effectiveness of IWO. Moreover, the electromagnetic (EM) simulations are also conducted to evaluate the beam patterns in practical conditions. The results show that IWO achieves the best performance compared with other algorithms for the LAA and the CAA optimization problems.
The rest of this paper is organized as follows. Section 2 discusses the geometries and the array factors of LAAs and CAAs. Section 3 formulates the sidelobe reduction problem. Section 4 introduces the IWO algorithm. Section 5 shows the simulation results. Section 6 summarizes the findings and concludes the paper.
2. System Model
In this section, the geometry structures and the array factors (AF) of LAA and CAA are introduced.
Figure 1 shows an LAA with 2N elements that are symmetrically distributed along the x-axis. The elements of the LAA are assumed as the isotropic radiators. Thus, according to the electromagnetic wave superposition principle, the AF of an LAA is expressed as follows : where k represents the wave number, In is the excitation current of the nth element, αn is the phase of the nth element, xn is the location of the nth element, and ϕ is the azimuth angle measured from the positive x-axis.
Figure 2 shows the geometry of a CAA with N isotropic antenna elements lying on the x-y plane (). These elements are uniformly placed on a ring with the radius of a. Similar with the LAA, the elements of the CAA are also assumed to be isotropic radiators. The AF of a CAA can be written as follows : where In is the excitation current of the nth element, αn is the phase of the nth element, and dn represents the arc distance between elements n and (d1 is the arc distance between the first () and the last () elements). ϕn and θn represent the azimuth angle measured from the positive x-axis and the elevation angle measured from the z-axis, respectively. Moreover, θ0 and ϕ0 are set to be 90° and 0°, respectively.
3. Problem Formulation
This work is aiming to design the antenna arrays with minimum SLL. The excitation currents I of the antenna elements affect the beam pattern directly; hence, an optimal set of excitation currents for each element need to be determined to achieve lower SLL. Therefore, the optimization problem can be formulated as follows:
subject to where ϕMSL is the angle of the maximum SLL and ϕML is the angle of the mainlobe, ϕFN1 and ϕFN2 are the first nulls in (−π, ϕFN1) and (−π, ϕFN2), respectively, and the first null beamwidth (FNBW) of the beam pattern can be determined by them. The constraint (4) determines the location of the mainlobe, the constraint (5) shows the range of the sidelobe, and the constraint (6) specifies the range of the normalized excitation current of each element.
4. Invasive Weed Optimization Algorithm
IWO is a novel numerical stochastic optimization algorithm inspired from weed colonization, and it is first proposed by Mehrabian and Lucas in reference . In the IWO approach, the whole population is composed of a certain number of weeds, and each weed is made up of a set of decision variables. The weed is a plant that is vigorous and invasive, and it poses a serious threat to the desirable plants. These features show that the weeds are very robust and troublous in the agriculture.
The working mechanism of IWO tried to imitate adaptation, robustness, and randomness of weeds in a very concise and efficient pattern. For a minimization problem, a weed with lower fitness value can generate more number of seeds. On the contrary, a weed with higher fitness value generates less number of seeds. The number of the newly generated seeds is decreased linearly from the maximum to the minimum allowable seeds in the colony. These newly generated seeds will be dispersed among the solution space with mean zero and varying standard deviations of normal distribution, and they will grow into new weeds. These weeds will generate new seeds. Moreover, in order to keep the certain number of the whole population, the weeds with worse fitness values will be eliminated from the colony.
The main procedure of IWO is shown in Figure 3, and the details of this algorithm are presented as follows.where Smin and Smax are the minimum and maximum number of the seeds, respectively, f is the fitness value of a certain weed, fworst and fbest denote the worst and best fitness values in a certain iteration, respectively, and floor is the round down operation.where σinitial and σfinal are the predefined initial and final standard deviations, respectively. iter is the current iteration and m is the nonlinear modulation index. Witer is a weed in the iterth iteration, is a normal random number with mean zero and standard deviation σiter.
Step 1. Initialization. In the first step of IWO, the algorithm initializes a certain number of weeds (candidate solutions) to construct a population and disperse these solutions to the d dimensional problem space uniformly and randomly.
Step 2. Reproduction. In this step, each solution in the population reproduces seeds according to its own lowest and highest fitness values in the colony. The number of seeds reproduced by a weed is given as follows:
Step 3. Spatial dispersal. Next, the newly generated seeds will be distributed over the d dimensional searching space and randomly spread in the vicinity of their parent weeds in the normal distribution with mean zero and varying standard deviations, to grow into new weeds. By this way, the search efficiency can be enhanced. The computing method of the standard deviation σiter in a specific iteration is shown in (8), and the new weeds can be generated by (9).
Step 4. Competitive exclusion. After several iterations, the number of weeds in the colony will exceed the predefined maximum limited value due to the growth and reproduction of the weeds. Therefore, an elimination mechanism needs to be applied to eliminate the weeds with worse fitness values until the maximum number of weeds in the colony is reached. Then, the reserved ones will remain to the next iteration.
For the beam pattern synthesis of the antenna array with IWO, the excitation currents of the elements can be regarded as a candidate solution in IWO and the solution can be expressed as follows: where n is the number of antenna elements. Then, the population of IWO can be written as follows: where N is the population size.
5. Simulation and Analysis
In this section, the beam pattern synthesis for reducing the SLL of the LAA and the CAA is simulated by Matlab. The simulations are performed on a computer with an Intel (R) Core (TM) 2 Duo CPU and a 3.00 GB RAM. First, the main parameters of IWO are tuned to achieve the best performance for the beam pattern synthesis. Second, usage of IWO to synthesize the beam pattern is simulated and the results are compared with CS, FA, BBO, and PSO. Then, the stabilities of IWO and these benchmark algorithms are compared. Finally, we conduct EM simulations to verify the optimization performance of the antenna arrays in practical conditions.
5.1. Parameter Tunings and Setups
The parameter values of σinitial and σfinal control the main updating procedure of IWO. Thus, they will be jointly tuned for achieving better performance of the algorithm. In the tuning test, the ranges of σinitial and σfinal are (0.01, 0.1) and (0.01, 0.1), respectively, and the steps are both 0.002. Thus, the total number of points for a tuning test is 2500. The tests are independently repeated for 50 times and the average values are presented. Figures 4(a), 4(b), 5(a), 5(b), 6(a), and 6(b) show the tuning results of the LAAs and the CAAs with 8, 16, and 32 elements. It can be seen from the figures that the optimal values of σinitial and σfinal are 0.05 and 0.01, respectively, for both LAA and CAA.
The other parameters of IWO and the benchmark algorithms are shown in Table 1. Moreover, for the benchmark algorithms, we use the versions and the parameter values in [26–29] for BBO, CS, FA, and PSO, and the detailed parameter setups of these algorithms are shown in Table 2. Moreover, the population size and the maximum iteration of each algorithm are 20 and 200, respectively, for fairness.
The time complexities of the algorithms above are analyzed here. The main computational cost will be the fitness function evaluations. Supposing the maximum number of iteration is t for each algorithm, then the time complexity of IWO is because there is only one inner loop in the algorithm; N is the population size. CS, FA, BBO, and PSO have similar algorithm structure with IWO; hence, the time complexities of these benchmark algorithms are also . As can be seen, the computational costs of these algorithms are relatively inexpensive because the complexities are linear in terms of t.
5.2. Beam Pattern Synthesis of the LAA
In this section, we use different algorithms to synthesize the beam patterns of the 8-element, 16-element, and 32-element LAAs, to compare the performances of these algorithms for the different dimensions of solutions.
5.2.1. Sample 1: Beam Pattern Synthesis for the 8-Element LAA
Figure 7(a) shows the beam patterns of an 8-element LAA obtained by the uniform array, PSO, BBO, FA, CS, and IWO. Note that the uniform array means that the excitation current of each antenna element is fixed as 1. Figure 7(b) shows the convergence rates during the optimization process of different algorithms. As can be seen, IWO has the best performance in terms of the accuracy as well as the convergence rate. Table 3 shows the maximum SLL obtained by these methods. It can be seen that the maximum SLL obtained by IWO is −19.5215 dB, which is the lowest among all the algorithms. Moreover, the excitation currents optimized by each algorithm is also listed in Table 3.
5.2.2. Sample 2: Beam Pattern Synthesis for the 16-Element LAA
In this sample, the beam patterns of a LAA with 16 elements are synthesized by different approaches. Figure 8(a) shows the beam patterns obtained by different algorithms and Figure 8(b) shows the convergence rate of these algorithms. Table 4 compares the numerical results. It can be seen from the figures and table that IWO has the best performance in terms of the maximum SLL suppression and convergence rate in this case. In addition, the excitation currents obtained by different algorithms are also shown in Table 4.
5.2.3. Sample 3: Beam Pattern Synthesis for the 32-Element LAA
Figure 9(a) shows the beam patterns of a 32-element LAA optimized by different algorithms, and Table 5 presents that the maximum SLLs obtained by IWO, CS, FA, BBO, and PSO are −31.0751 dB, −29.3774 dB, −26.0192 dB, −23.4108 dB, and −20.4785 dB, respectively. Moreover, the maximum SLL of the uniform array is −13.2318 dB. The excitation currents of these algorithms are also presented in the table. Figure 9(b) shows the convergence rates during the optimization process. Similar to the previous samples, IWO also has the best performance for this case.
5.3. Beam Pattern Synthesis of the CAA
The beam pattern synthesis results of the CAA are presented in this section. Corresponding to the case of LAA, three samples that are 8-element, 16-element, and 32-element CAAs are optimized by different algorithms.
5.3.1. Sample 4: Beam Pattern Synthesis for the 8-Element CAA
Figure 10(a) shows the beam patterns of an 8-element CAA optimized by different algorithms, and the convergence rates of these methods are shown in Figure 10(b). The maximum SLLs obtained by these algorithms are listed in Table 6. As can be seen, the maximum SLL obtained by IWO is −6.2535 dB, which is the lowest among all the approaches. Moreover, the excitation currents obtained by different algorithms are also shown in Table 6.
5.3.2. Sample 5: Beam Pattern Synthesis for the 16-Element CAA
In this sample, we use different algorithms to optimize a 16-element CAA. Figures 11(a) and 11(b) show the beam pattern results and the convergence rates, respectively, and Table 7 compares the numerical results of the maximum SLL. As can be seen, the maximum SLL obtained by the uniform array, CS, FA, BBO, and PSO are −6.7578 dB, −10.1490 dB, −9.2885 dB, −9.1592 dB, and −9.0261 dB, respectively, and it is −10.7440 dB by using IWO. Thus, IWO achieves the best results for reducing the maximum SLL. Moreover, the excitation currents optimized by these algorithms are presented in Table 7.
5.3.3. Sample 6: Beam Pattern Synthesis for the 32-Element CAA
Figure 12(a) shows the beam patterns of a 32-element CAA optimized by different approaches, and the convergence rates of these algorithms are shown in Figure 12(b). Table 8 lists the maximum SLLs as well as the excitation currents obtained by these algorithms. Similar with the 8-element and the 16-element cases, IWO achieves the lowest SLL compared with other algorithms.
5.4. Stability Test
The swarm intelligence optimization algorithms such as PSO are stochastic, hence the optimization results that are likely to be different for each independent run. Therefore, statistical tests are necessary to analyze the performance of such algorithms. Thus, tests for synthesizing the beam patterns of the LAAs and the CAAs with different numbers of elements are conducted, and each test is with 30 independent trials.
Figures 13(a), 13(b), 14(a), 14(b), 15(a), and 15(b) show the maximum SLLs obtained by different algorithms of the 30 trials for the LAAs and the CAAs with different numbers of antenna elements. Tables 9, 10, 11, 12, 13, and 14 show the statistical results in terms of the best, the worst, the mean values of the maximum SLLs, and the standard divisions (SD) of these trials. As can be seen, IWO achieves the lowest average maximum SLLs for both LAA and CAA. Moreover, the SDs of IWO are also the lowest which means that the stability performance of IWO is the best compared with other benchmark algorithms for the sidelobe reductions of both LAA and CAA.
5.5. EM Simulations
To verify the beam pattern performances of the antenna arrays obtained by IWO as well as other algorithms in practical conditions, we design the LAAs (8-element, 16-element, and 32-element) and the CAAs (8-element, 16-element, and 32-element) for EM simulations based on ANSYS Electromagnetics 2016 (HFSS 15.0). First, a physical structure of the array element is designed and we use the element to construct the LAAs and the CAAs. Then, we use the excitation currents obtained by uniform excitations, IWO, CS, FA, BBO, and PSO from Tables 3 to 8 for the LAAs and the CAAs, respectively, to conduct the EM simulations. Figures 16(a) and 16(b) show the beam patterns of the 8-element LAA and CAA with different excitation currents obtained by uniform excitations, IWO, CS, FA, BBO, and PSO, respectively. It can be seen from the figures that all of the optimization algorithms can reduce the maximum SLL compared with the uniform excitation method. However, IWO achieves the lowest maximum SLL among other methods. Figures 17(a) and 17(b) show the beam patterns of the 16-element LAA and CAA obtained by different algorithms. Figures 18(a) and 18(b) show the optimization results of EM simulation for the 32-element LAA and CAA, respectively. As can be seen, similar with cases of the 8-element LAA and CAA, the beam patterns obtained by IWO also have the lowest maximum SLL with a high number of antenna elements. Therefore, IWO has a better performance for reducing the maximum SLLs of the LAAs and the CAAs in practical conditions.
Moreover, to verify the differences of the beam patterns caused by the mutual coupling, we compare the results obtained by the model used for optimization and the EM model. Figures 19(a) and 19(b) show the beam patterns obtained by the uniform excitation currents and by IWO in ideal (the array model used for optimization and simulation) and practical (the array model used for EM simulation) conditions with EM simulations. As can be seen, the beam patterns of the practical condition are distorted compared to the ideal beam patterns. Moreover, the maximum SLLs of practical condition in EM simulation are higher than that in ideal condition obtained by Matlab. Thus, the mutual coupling affects the beam pattern performance. However, the IWO algorithm is still able to provide improvement for reducing the maximum SLL in practical conditions with mutual coupling.
In this paper, the IWO algorithm is used to solve the beam pattern synthesis problem of the LAA and the CAA. We formulate an optimization problem for this goal and use IWO as the optimizer to determine a set of optimal excitation currents to achieve the desired beam patterns. Six samples including 8-element, 16-element, and 32-element LAAs and CAAs are conducted to verify the optimization performances of the SLL reductions. Simulation results show that the SLLs can be effectively reduced by IWO. Moreover, compared with other benchmark algorithms, IWO has a better performance in terms of the accuracy, the convergence rate, and the stability. In addition, EM simulation results demonstrate that the optimization results obtained by IWO are also effective for the antenna arrays in practical conditions.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
This work was supported by the National Natural Science Foundation of China (Grant no. 61373123), the Chinese Scholarship Council (no.  3100), and the Graduate Innovation Fund of Jilin University (2017016).
- S. Liang, T. Feng, and G. Sun, “Sidelobe-level suppression for linear and circular antenna arrays via the cuckoo search–chicken swarm optimisation algorithm,” IET Microwaves, Antennas & Propagation, vol. 11, no. 2, pp. 209–218, 2016.
- I. F. Akyildiz, S. Nie, S. C. Lin, and M. Chandrasekaran, “5G roadmap: 10 key enabling technologies,” Computer Networks, vol. 106, pp. 17–48, 2016.
- D. Z. Zhu, P. L. Werner, and D. H. Werner, “Design and optimization of 3-D frequency-selective surfaces based on a multiobjective lazy ant colony optimization algorithm,” IEEE Transactions on Antennas & Propagation, vol. 65, no. 12, pp. 7137–7149, 2017.
- G. Sun, Y. Liu, S. Liang, A. Wang, and Y. Zhang, “Beam pattern design of circular antenna array via efficient biogeography-based optimization,” AEU-International Journal of Electronics and Communications, vol. 79, pp. 275–285, 2017.
- G. Sun, Y. H. Liu, J. Zhang, A. M. Wang, and X. Zhou, “Node selection optimization for collaborative beamforming in wireless sensor networks,” Ad Hoc Networks, vol. 37, pp. 389–403, 2016.
- G. Sun, Y. H. Liu, A. M. Wang, J. Zhang, X. Zhou, and Z. Liu, “Sidelobe control by node selection algorithm based on virtual linear array for collaborative beamforming in WSNs,” Wireless Personal Communications, vol. 90, no. 3, pp. 1443–1462, 2016.
- H. Li, Y. Liu, G. Sun, A. Wang, and S. Liang, “Beam pattern synthesis based on improved biogeography-based optimization for reducing sidelobe level,” Computers & Electrical Engineering, vol. 60, pp. 161–174, 2017.
- S. Jayaprakasam, S. K. A. Rahim, C. Y. Leow, T. O. Ting, and A. Eteng, “Multiobjective beampattern optimization in collaborative beamforming via NSGA-II with selective distance,” IEEE Transactions on Antennas and Propagation, vol. 65, no. 5, pp. 2348–2357, 2017.
- M. Fakharzadeh, S. H. Jamali, S. Safavi-Naeini, and P. Mousavi, “A fast calibration algorithm for phased array antennas based on a modified perturbation method,” in 2006 IEEE Antennas and Propagation Society International Symposium, pp. 3343–3346, Albuquerque, NM, USA, July 2006.
- B. K. Lau and Y. H. Leung, “A Dolph-Chebyshev approach to the synthesis of array patterns for uniform circular arrays,” in 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), vol. 1, pp. 124–127, Geneva, Switzerland, Switzerland, May 2000.
- M. A. Sarker, M. S. Hossain, and M. S. Masud, “Robust beamforming synthesis technique for low side lobe level using taylor excited antenna array,” in 2016 2nd International Conference on Electrical, Computer & Telecommunication Engineering (ICECTE), pp. 1–4, Rajshahi, Bangladesh, December 2016.
- S. Todnatee and C. Phongcharoenpanich, “Iterative GA optimization scheme for synthesis of radiation pattern of linear array antenna,” International Journal of Antennas and Propagation, vol. 2016, Article ID 7087298, 8 pages, 2016.
- V. Chakravarthy and P. M. Rao, “Circular array antenna optimization with scanned and unscanned beams using novel particle swarm optimization,” Indian Journal of Applied Research, vol. 5, no. 4, 2015.
- G. Ram, D. Mandal, R. Kar, and S. P. Ghoshal, “Pencil beam pattern synthesis of time-modulated concentric circular antenna array using PSO with aging leader and challenger,” Journal of Electromagnetic Waves and Applications, vol. 29, no. 12, pp. 1610–1629, 2015.
- A. Sharaqa and N. Dib, “Circular antenna array synthesis using firefly algorithm,” International Journal of RF and Microwave Computer-Aided Engineering, vol. 24, no. 2, pp. 139–146, 2014.
- U. Singh and R. Salgotra, “Synthesis of linear antenna array using flower pollination algorithm,” Neural Computing and Applications, vol. 29, no. 2, pp. 435–445, 2018.
- P. Saxena and A. Kothari, “Optimal pattern synthesis of linear antenna array using grey wolf optimization algorithm,” International Journal of Antennas and Propagation, vol. 2016, Article ID 1205970, 11 pages, 2016.
- G. Sun, Y. Liu, Z. Chen, Y. Zhang, A. Wang, and S. Liang, “Thinning of concentric circular antenna arrays using improved discrete cuckoo search algorithm,” in 2017 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–6, San Francisco, CA, USA, March 2017.
- G. Sun, Y. Liu, J. Li, Y. Zhang, and A. Wang, “Sidelobe reduction of large-scale antenna array for 5G beamforming via hierarchical cuckoo search,” Electronics Letters, vol. 53, no. 16, pp. 1158–1160, 2017.
- A. Boldini, C. A. Gonano, F. Grimaccia et al., “Planar array optimization by means of SNO and StudGA,” in IEEE Antennas and Propagation Society International Symposium (APSURSI), pp. 1950-1951, Memphis, TN, USA, July 2014.
- P. Saxena and A. Kothari, “Ant lion optimization algorithm to control side lobe level and null depths in linear antenna arrays,” Aeu-International Journal of Electronics and Communications, vol. 70, no. 9, pp. 1339–1349, 2016.
- S. Jayaprakasam, S. Rahim, and C. Y. Leow, “PSOGSA-explore: a new hybrid metaheuristic approach for beampattern optimization in collaborative beamforming,” Applied Soft Computing, vol. 30, pp. 229–237, 2015.
- U. Singh, R. Salgotra, and M. Rattan, “A novel binary spider monkey optimization algorithm for thinning of concentric circular antenna arrays,” Iete Journal of Research, vol. 62, no. 6, pp. 736–744, 2016.
- A. R. Mehrabian and C. Lucas, “A novel numerical optimization algorithm inspired from weed colonization,” Ecological Informatics, vol. 1, no. 4, pp. 355–366, 2006.
- A. Sharaqa and N. Dib, “Design of linear and elliptical antenna arrays using biogeography based optimization,” Arabian Journal for Science and Engineering, vol. 39, no. 4, pp. 2929–2939, 2014.
- D. Simon, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 6, pp. 702–713, 2008.
- X.-S. Yang and S. Deb, “Cuckoo search via Lévy flights,” in 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), pp. 210–214, Coimbatore, India, December 2009.
- X.-S. Yang, “Firefly algorithms for multimodal optimization,” in International Symposium on Stochastic Algorithms, pp. 169–178, Springer, 2009.
- J. Kennedy, “Particle swarm optimization,” Encyclopedia of Machine Learning, Springer, 2011.
Copyright © 2018 Geng Sun 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.