Genetic Algorithms in Electromagnetics
Home > Science, Technology & Agriculture > Electronics and communications engineering > Genetic Algorithms in Electromagnetics: (IEEE Press)
Genetic Algorithms in Electromagnetics: (IEEE Press)

Genetic Algorithms in Electromagnetics: (IEEE Press)


     0     
5
4
3
2
1



International Edition


X
About the Book

A thorough and insightful introduction to using genetic algorithms to optimize electromagnetic systems Genetic Algorithms in Electromagnetics focuses on optimizing the objective function when a computer algorithm, analytical model, or experimental result describes the performance of an electromagnetic system. It offers expert guidance to optimizing electromagnetic systems using genetic algorithms (GA), which have proven to be tenacious in finding optimal results where traditional techniques fail. Genetic Algorithms in Electromagnetics begins with an introduction to optimization and several commonly used numerical optimization routines, and goes on to feature: Introductions to GA in both binary and continuous variable forms, complete with examples of MATLAB(r) commands Two step-by-step examples of optimizing antenna arrays as well as a comprehensive overview of applications of GA to antenna array design problems Coverage of GA as an adaptive algorithm, including adaptive and smart arrays as well as adaptive reflectors and crossed dipoles Explanations of the optimization of several different wire antennas, starting with the famous "crooked monopole" How to optimize horn, reflector, and microstrip patch antennas, which require significantly more computing power than wire antennas Coverage of GA optimization of scattering, including scattering from frequency selective surfaces and electromagnetic band gap materials Ideas on operator and parameter selection for a GA Detailed explanations of particle swarm optimization and multiple objective optimization An appendix of MATLAB code for experimentation

Table of Contents:
Preface. Acknowledgments. 1. Introduction to Optimization in Electromagnetics. 1.1 Optimizing a Function of One Variable. 1.1.1 Exhaustive Search. 1.1.2 Random Search. 1.1.3 Golden Search. 1.1.4 Newton’s Method. 1.1.5 Quadratic Interpolation. 1.2 Optimizing a Function of Multiple Variables. 1.2.1 Random Search. 1.2.2 Line Search. 1.2.3 Nelder–Mead Downhill Simplex Algorithm. 1.3 Comparing Local Numerical Optimization Algorithms. 1.4 Simulated Annealing. 1.5 Genetic Algorithm. 2. Anatomy of a Genetic Algorithm. 2.1 Creating an Initial Population. 2.2 Evaluating Fitness. 2.3 Natural Selection. 2.4 Mate Selection. 2.4.1 Roulette Wheel Selection. 2.4.2 Tournament Selection. 2.5 Generating Offspring. 2.6 Mutation. 2.7 Terminating the Run. 3. Step-by-Step Examples. 3.1 Placing Nulls. 3.2 Thinned Arrays. 4. Optimizing Antenna Arrays. 4.1 Optimizing Array Amplitude Tapers. 4.2 Optimizing Array Phase Tapers. 4.2.1 Optimum Quantized Low-Sidelobe Phase Tapers. 4.2.2 Phase-Only Array Synthesis Using Adaptive GAs. 4.3 Optimizing Arrays with Complex Weighting. 4.3.1 Shaped-Beam Synthesis. 4.3.2 Creating a Plane Wave in the Near Field. 4.4 Optimizing Array Element Spacing. 4.4.1 Thinned Arrays. 4.4.2 Interleaved Thinned Linear Arrays. 4.4.3 Array Element Perturbation. 4.4.4 Aperiodic Fractile Arrays. 4.4.5 Fractal–Random and Polyfractal Arrays. 4.4.6 Aperiodic Refl ectarrays. 4.5 Optimizing Conformal Arrays. 4.6 Optimizing Reconfi gurable Apertures. 4.6.1 Planar Reconfi gurable Cylindrical Wire Antenna Design. 4.6.2 Planar Reconfi gurable Ribbon Antenna Design. 4.6.3 Design of Volumetric Reconfi gurable Antennas. 4.6.4 Simulation Results—Planar Reconfi gurable Cylindrical Wire Antenna. 4.6.5 Simulation Results—Volumetric Reconfi gurable Cylindrical Wire Antenna. 4.6.6 Simulation Results—Planar Reconfi gurable Ribbon Antenna. 5. Smart Antennas Using a GA. 5.1 Amplitude and Phase Adaptive Nulling. 5.2 Phase-Only Adaptive Nulling. 5.3 Adaptive Reflector. 5.4 Adaptive Crossed Dipoles. 6. Genetic Algorithm Optimization of Wire Antennas. 6.1 Introduction. 6.2 GA Design of Electrically Loaded Wire Antennas. 6.3 GA Design of Three-Dimensional Crooked-Wire Antennas. 6.4 GA Design of Planar Crooked-Wire and Meander-Line Antennas. 6.5 GA Design of Yagi–Uda Antennas. 7. Optimization of Aperture Antennas. 7.1 Refl ector Antennas. 7.2 Horn Antennas. 7.3 Microstrip Antennas. 8. Optimization of Scattering. 8.1 Scattering from an Array of Strips. 8.2 Scattering from Frequency-Selective Surfaces. 8.2.1 Optimization of FSS Filters. 8.2.2 Optimization of Reconfi gurable FSSs. 8.2.3 Optimization of EBGs. 8.3 Scattering from Absorbers. 8.3.1 Conical or Wedge Absorber Optimization. 8.3.2 Multilayer Dielectric Broadband Absorber Optimization. 8.3.3 Ultrathin Narrowband Absorber Optimization. 9. GA Extensions. 9.1 Selecting Population Size and Mutation Rate. 9.2 Particle Swarm Optimization (PSO). 9.3 Multiple-Objective Optimization. 9.3.1 Introduction. 9.3.2 Strength Pareto Evolutionary Algorithm—Strength Value Calculation. 9.3.3 Strength Pareto Evolutionary Algorithm—Pareto Set Clustering. 9.3.4 Strength Pareto Evolutionary Algorithm—Implementation. 9.3.5 SPEA-Optimized Planar Arrays. 9.3.6 SPEA-Optimized Planar Polyfractal Arrays. Appendix: MATLAB® Code. Bibliography. Index.

About the Author :
Randy L. Haupt, PhD, is a senior scientist in the Applied Research Laboratory at The Pennsylvania State University. Douglas H. Werner, PhD, is a professor of electrical engineering, a senior scientist in the Applied Research Laboratory, and a faculty member of the Materials Research Institute at The Pennsylvania State University.

Review :
"…a boon to senior and graduate engineering students who have to complete a design project." (CHOICE, September 2007)


Best Sellers


Product Details
  • ISBN-13: 9780471488897
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: Wiley-IEEE Press
  • Height: 241 mm
  • No of Pages: 320
  • Returnable: N
  • Spine Width: 22 mm
  • Width: 163 mm
  • ISBN-10: 0471488895
  • Publisher Date: 26 Apr 2007
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Series Title: IEEE Press
  • Weight: 590 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Genetic Algorithms in Electromagnetics: (IEEE Press)
John Wiley & Sons Inc -
Genetic Algorithms in Electromagnetics: (IEEE Press)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Genetic Algorithms in Electromagnetics: (IEEE Press)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!