Abstract
This paper describes a modified real genetic algorithm (MGA) for the synthesis of sparse linear arrays. The MGA has been utilized to optimize the element positions to reduce the peak sidelobe level (PSLL) of the array. And here the multiple optimization constraints include the number of elements, the aperture and the minimum element spacing. Unlike standard GA using fixed corresponding relationship between the gene variables and their coding, the MGA utilized the coding resetting of gene variables to avoid infeasible solution during the optimization process. Also, the proposed approach has reduced the size of the searching area of the GA by means of indirect description of individual. The simulated results confirming the great efficiency and the robustness of this algorithm are provided in this paper.
Published Version
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.
