Abstract
Several antenna design problems are discrete valued. Particle swarm optimization (PSO) and differential evolution (DE) are popular evolutionary algorithms that have been applied to a number of design problems in electromagnetics. However, both PSO and DE are best suited for continuous search spaces. Therefore, to apply these to binary-coded combinatorial optimization problems, binary versions of the aforementioned algorithms must be used. In this article, we introduce a design technique based on novel binary DE (NBDE). The main benefit of NBDE is reserving the DE updating strategy to binary space.
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.
