Abstract
As a very powerful optimisation approach, differential evolution algorithm for continuous optimisation problems has been applied to electromagnetic (EM) design problems. However, the optimisation of a thinned array can be formulated as a discrete-variable optimisation problem with solutions encoded as binary strings. Here, a Boolean differential evolution (BDE) algorithm for 0–1 integer programming problems is proposed to design planar thinned arrays with minimum sidelobe levels. The BDE algorithm with only one control parameter is easily implemented. Meanwhile, a fast Fourier transform is employed to speed up the calculation of the pattern. Numerical experiments show that the BDE algorithm is an effective technique.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
