• DocumentCode
    840244
  • Title

    Optimizing backscattering from arrays of perfectly conducting strips

  • Author

    Haupt, Randy ; Chung, You Chung

  • Author_Institution
    Electr. & Comput. Eng., Utah State Univ., Logan, UT, USA
  • Volume
    45
  • Issue
    5
  • fYear
    2003
  • Firstpage
    26
  • Lastpage
    33
  • Abstract
    Eight different numerical optimization algorithms tackled the problem of finding the best spacings for an array of perfectly conducting strips in order to get desirable backscattering characteristics. Local optimizers worked well when the problem was relatively simple and had few parameters. As the complexity of the problem increased, the genetic algorithm proved a better approach. In general, a hybrid genetic algorithm (GA) worked best, because it combined the power of the local search with a global search. This paper presents optimized results that were averaged over twenty independent runs, and discusses the pros and cons of the various approaches.
  • Keywords
    arrays; backscatter; conducting bodies; genetic algorithms; radar cross-sections; search problems; Broyden-Fletcher-Goldfarb-Shannon technique; Davidon-Fletcher-Powell technique; Nelder Mead downhill simplex technique; backscattering; binary GA; continuous-parameter GA; global search; hybrid genetic algorithm; local search; numerical optimization algorithms; perfectly conducting strip array; random search technique; steepest descent technique; Backscatter; Conductors; Contracts; Creep; Electromagnetic scattering; Finite difference methods; Genetic algorithms; Optimization methods; Radar cross section; Radar scattering;
  • fLanguage
    English
  • Journal_Title
    Antennas and Propagation Magazine, IEEE
  • Publisher
    ieee
  • ISSN
    1045-9243
  • Type

    jour

  • DOI
    10.1109/MAP.2003.1252807
  • Filename
    1252807