Genetic algorithms with adaptive parameters for phased array synthesis

D. W. Boeringer, Douglas Henry Werner

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Motivated by Darwin's theories of evolution and the concept of "survival of the fittest", 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 genetic algorithm that simultaneously adapts these parameters during the optimization process, which is shown to outperform its best static counterpart when used to synthesize phased array weights to satisfy a specified far field sidelobe envelope. 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 reduced.

Original languageEnglish (US)
Pages (from-to)169-172
Number of pages4
JournalAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)
Volume1
StatePublished - 2003

Fingerprint

Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{c82ebb9ff6c74e1d99bcc7d1a5bb0975,
title = "Genetic algorithms with adaptive parameters for phased array synthesis",
abstract = "Motivated by Darwin's theories of evolution and the concept of {"}survival of the fittest{"}, 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 genetic algorithm that simultaneously adapts these parameters during the optimization process, which is shown to outperform its best static counterpart when used to synthesize phased array weights to satisfy a specified far field sidelobe envelope. 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 reduced.",
author = "Boeringer, {D. W.} and Werner, {Douglas Henry}",
year = "2003",
language = "English (US)",
volume = "1",
pages = "169--172",
journal = "AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)",
issn = "0272-4693",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Genetic algorithms with adaptive parameters for phased array synthesis

AU - Boeringer, D. W.

AU - Werner, Douglas Henry

PY - 2003

Y1 - 2003

N2 - Motivated by Darwin's theories of evolution and the concept of "survival of the fittest", 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 genetic algorithm that simultaneously adapts these parameters during the optimization process, which is shown to outperform its best static counterpart when used to synthesize phased array weights to satisfy a specified far field sidelobe envelope. 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 reduced.

AB - Motivated by Darwin's theories of evolution and the concept of "survival of the fittest", 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 genetic algorithm that simultaneously adapts these parameters during the optimization process, which is shown to outperform its best static counterpart when used to synthesize phased array weights to satisfy a specified far field sidelobe envelope. 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 reduced.

UR - http://www.scopus.com/inward/record.url?scp=0042474341&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042474341&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0042474341

VL - 1

SP - 169

EP - 172

JO - AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)

JF - AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)

SN - 0272-4693

ER -