A simultaneous parameter adaptation scheme for genetic algorithms with application to phased array synthesis

Daniel W. Boeringer, Douglas Henry Werner, David W. Machuga

Research output: Contribution to journalArticlepeer-review

76 Scopus citations

Abstract

Genetic algorithms are commonly used to solve many optimization and synthesis problems. An important issue facing the user is the selection of genetic algorithm parameters, such as mutation rate, mutation range, and number of crossovers. This paper demonstrates a real-valued genetic algorithm that simultaneously adapts several such parameters during the optimization process. This adaptive algorithm is shown to outperform its static counterparts when used to synthesize the phased array weights to satisfy specified far-field sidelobe constraints, and can perform amplitude-only, phase-only, and complex weight synthesis. When compared to conventional static parameter implementations, computation time is saved in two ways: 1) The algorithm converges faster and 2) the need to tune parameters by hand (generally done by repeatedly running the code with different parameter choices) is greatly reduced. By requiring less iteration to solve a given problem, this approach may benefit electromagnetic optimization problems with expensive cost functions, since genetic algorithms generally require many function evaluations to converge. The adaptive process also provides insight into the qualitative importance of parameters, and dynamically, adjusting the mutation range is found to be especially beneficial.

Original languageEnglish (US)
Pages (from-to)356-371
Number of pages16
JournalIEEE Transactions on Antennas and Propagation
Volume53
Issue number1 II
DOIs
StatePublished - Jan 1 2005

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A simultaneous parameter adaptation scheme for genetic algorithms with application to phased array synthesis'. Together they form a unique fingerprint.

Cite this