Abstract
It is generally believed genetic algorithm (GA) is superior to particle swarm optimization (PSO) while dealing with the discrete optimization problems. In this paper, a suitable mapping method is adopted and the modifled PSO can efiectively deal with the discrete optimization problems of linear array pattern synthesis. This strategy has been applied in thinned linear array pattern synthesis with minimum sidelobe level, 4-bit digital phase shifter linear array pattern synthesis and unequally spaced thinned array pattern synthesis with minimum sidelobe level. The obtained results are all superior to those in existing literatures with GA, iterative FFT and difierent versions of binary PSO, that show the efiectiveness of this strategy and its potential application to other discrete electromagnetic optimization problems.
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.
