Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Antenna arrays : a computational approach / / Randy L. Haupt
| Antenna arrays : a computational approach / / Randy L. Haupt |
| Autore | Haupt Randy L |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | New York, : Wiley |
| Descrizione fisica | 1 online resource (550 p.) |
| Disciplina | 621.3824 |
| Soggetto topico |
Antenna arrays - Mathematical models
Antennas (Electronics) |
| ISBN |
1-282-81723-X
9786612817236 0-470-93743-2 0-470-93746-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front Matter -- Antenna Array Basics -- Array Factor Analysis -- Linear and Planar Array Factor Synthesis -- Array Factors and Element Patterns -- Nonplanar Arrays -- Mutual Coupling -- Array Beamforming Networks -- Smart Arrays -- Index. |
| Record Nr. | UNINA-9910876627503321 |
Haupt Randy L
|
||
| New York, : Wiley | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Genetic algorithms in electromagnetics / / Randy L. Haupt, Douglas H. Werner
| Genetic algorithms in electromagnetics / / Randy L. Haupt, Douglas H. Werner |
| Autore | Haupt Randy L |
| Pubbl/distr/stampa | Hoboken, New Jersey : , : IEEE Press : , c2007 |
| Descrizione fisica | 1 online resource (317 p.) |
| Disciplina |
537.015197
621.30285/631 621.30285631 |
| Altri autori (Persone) | WernerDouglas H. <1960-> |
| Soggetto topico |
Antenna arrays - Design
Electromagnetism - Mathematical models Genetic algorithms |
| ISBN |
0-470-65345-0
1-280-82671-1 9786610826711 0-470-10628-X 0-470-10627-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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 Yagida 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. |
| Record Nr. | UNINA-9910143557503321 |
|
Haupt Randy L
|
||
| Hoboken, New Jersey : , : IEEE Press : , c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Genetic algorithms in electromagnetics / / Randy L. Haupt, Douglas H. Werner
| Genetic algorithms in electromagnetics / / Randy L. Haupt, Douglas H. Werner |
| Autore | Haupt Randy L |
| Pubbl/distr/stampa | Hoboken, New Jersey : , : IEEE Press : , c2007 |
| Descrizione fisica | 1 online resource (317 p.) |
| Disciplina |
537.015197
621.30285/631 621.30285631 |
| Altri autori (Persone) | WernerDouglas H. <1960-> |
| Soggetto topico |
Antenna arrays - Design
Electromagnetism - Mathematical models Genetic algorithms |
| ISBN |
0-470-65345-0
1-280-82671-1 9786610826711 0-470-10628-X 0-470-10627-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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 Yagida 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. |
| Record Nr. | UNINA-9910831035903321 |
|
Haupt Randy L
|
||
| Hoboken, New Jersey : , : IEEE Press : , c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Genetic algorithms in electromagnetics / / Randy L. Haupt, Douglas H. Werner
| Genetic algorithms in electromagnetics / / Randy L. Haupt, Douglas H. Werner |
| Autore | Haupt Randy L |
| Pubbl/distr/stampa | Hoboken, N.J., : IEEE Press, : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (317 p.) |
| Disciplina | 621.30285/631 |
| Altri autori (Persone) | WernerDouglas H. <1960-> |
| Soggetto topico |
Antenna arrays - Design
Electromagnetism - Mathematical models Genetic algorithms |
| ISBN |
0-470-65345-0
1-280-82671-1 9786610826711 0-470-10628-X 0-470-10627-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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 Yagida 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. |
| Record Nr. | UNINA-9910878091703321 |
|
Haupt Randy L
|
||
| Hoboken, N.J., : IEEE Press, : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Practical genetic algorithms [[electronic resource] /] / Randy L. Haupt, Sue Ellen Haupt
| Practical genetic algorithms [[electronic resource] /] / Randy L. Haupt, Sue Ellen Haupt |
| Autore | Haupt Randy L |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : John Wiley, c2004 |
| Descrizione fisica | 1 online resource (273 p.) |
| Disciplina | 519.62 |
| Altri autori (Persone) | HauptS. E |
| Soggetto topico | Genetic algorithms |
| ISBN |
1-280-54212-8
9786610542123 0-471-67175-4 0-471-67174-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
PRACTICAL GENETIC ALGORITHMS; CONTENTS; Preface; Preface to First Edition; List of Symbols; 1 Introduction to Optimization; 1.1 Finding the Best Solution; 1.1.1 What Is Optimization?; 1.1.2 Root Finding versus Optimization; 1.1.3 Categories of Optimization; 1.2 Minimum-Seeking Algorithms; 1.2.1 Exhaustive Search; 1.2.2 Analytical Optimization; 1.2.3 Nelder-Mead Downhill Simplex Method; 1.2.4 Optimization Based on Line Minimization; 1.3 Natural Optimization Methods; 1.4 Biological Optimization: Natural Selection; 1.5 The Genetic Algorithm; Bibliography; Exercises
2 The Binary Genetic Algorithm2.1 Genetic Algorithms: Natural Selection on a Computer; 2.2 Components of a Binary Genetic Algorithm; 2.2.1 Selecting the Variables and the Cost Function; 2.2.2 Variable Encoding and Decoding; 2.2.3 The Population; 2.2.4 Natural Selection; 2.2.5 Selection; 2.2.6 Mating; 2.2.7 Mutations; 2.2.8 The Next Generation; 2.2.9 Convergence; 2.3 A Parting Look; Bibliography; Exercises; 3 The Continuous Genetic Algorithm; 3.1 Components of a Continuous Genetic Algorithm; 3.1.1 The Example Variables and Cost Function; 3.1.2 Variable Encoding, Precision, and Bounds 3.1.3 Initial Population3.1.4 Natural Selection; 3.1.5 Pairing; 3.1.6 Mating; 3.1.7 Mutations; 3.1.8 The Next Generation; 3.1.9 Convergence; 3.2 A Parting Look; Bibliography; Exercises; 4 Basic Applications; 4.1 "Mary Had a Little Lamb"; 4.2 Algorithmic Creativity-Genetic Art; 4.3 Word Guess; 4.4 Locating an Emergency Response Unit; 4.5 Antenna Array Design; 4.6 The Evolution of Horses; 4.5 Summary; Bibliography; 5 An Added Level of Sophistication; 5.1 Handling Expensive Cost Functions; 5.2 Multiple Objective Optimization; 5.2.1 Sum of Weighted Cost Functions; 5.2.2 Pareto Optimization 5.3 Hybrid GA5.4 Gray Codes; 5.5 Gene Size; 5.6 Convergence; 5.7 Alternative Crossovers for Binary GAs; 5.8 Population; 5.9 Mutation; 5.10 Permutation Problems; 5.11 Selecting GA Parameters; 5.12 Continuous versus Binary GA; 5.13 Messy Genetic Algorithms; 5.14 Parallel Genetic Algorithms; 5.14.1 Advantages of Parallel GAs; 5.14.2 Strategies for Parallel GAs; 5.14.3 Expected Speedup; 5.14.4 An Example Parallel GA; 5.14.5 How Parallel GAs Are Being Used; Bibliography; Exercises; 6 Advanced Applications; 6.1 Traveling Salesperson Problem; 6.2 Locating an Emergency Response Unit Revisited 6.3 Decoding a Secret Message6.4 Robot Trajectory Planning; 6.5 Stealth Design; 6.6 Building Dynamic Inverse Models-The Linear Case; 6.7 Building Dynamic Inverse Models-The Nonlinear Case; 6.8 Combining GAs with Simulations-Air Pollution Receptor Modeling; 6.9 Optimizing Artificial Neural Nets with GAs; 6.10 Solving High-Order Nonlinear Partial Differential Equations; Bibliography; 7 More Natural Optimization Algorithms; 7.1 Simulated Annealing; 7.2 Particle Swarm Optimization (PSO); 7.3 Ant Colony Optimization (ACO); 7.4 Genetic Programming (GP); 7.5 Cultural Algorithms 7.6 Evolutionary Strategies |
| Record Nr. | UNINA-9910145765503321 |
|
Haupt Randy L
|
||
| Hoboken, N.J., : John Wiley, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Practical genetic algorithms [[electronic resource] /] / Randy L. Haupt, Sue Ellen Haupt
| Practical genetic algorithms [[electronic resource] /] / Randy L. Haupt, Sue Ellen Haupt |
| Autore | Haupt Randy L |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : John Wiley, c2004 |
| Descrizione fisica | 1 online resource (273 p.) |
| Disciplina | 519.62 |
| Altri autori (Persone) | HauptS. E |
| Soggetto topico | Genetic algorithms |
| ISBN |
1-280-54212-8
9786610542123 0-471-67175-4 0-471-67174-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
PRACTICAL GENETIC ALGORITHMS; CONTENTS; Preface; Preface to First Edition; List of Symbols; 1 Introduction to Optimization; 1.1 Finding the Best Solution; 1.1.1 What Is Optimization?; 1.1.2 Root Finding versus Optimization; 1.1.3 Categories of Optimization; 1.2 Minimum-Seeking Algorithms; 1.2.1 Exhaustive Search; 1.2.2 Analytical Optimization; 1.2.3 Nelder-Mead Downhill Simplex Method; 1.2.4 Optimization Based on Line Minimization; 1.3 Natural Optimization Methods; 1.4 Biological Optimization: Natural Selection; 1.5 The Genetic Algorithm; Bibliography; Exercises
2 The Binary Genetic Algorithm2.1 Genetic Algorithms: Natural Selection on a Computer; 2.2 Components of a Binary Genetic Algorithm; 2.2.1 Selecting the Variables and the Cost Function; 2.2.2 Variable Encoding and Decoding; 2.2.3 The Population; 2.2.4 Natural Selection; 2.2.5 Selection; 2.2.6 Mating; 2.2.7 Mutations; 2.2.8 The Next Generation; 2.2.9 Convergence; 2.3 A Parting Look; Bibliography; Exercises; 3 The Continuous Genetic Algorithm; 3.1 Components of a Continuous Genetic Algorithm; 3.1.1 The Example Variables and Cost Function; 3.1.2 Variable Encoding, Precision, and Bounds 3.1.3 Initial Population3.1.4 Natural Selection; 3.1.5 Pairing; 3.1.6 Mating; 3.1.7 Mutations; 3.1.8 The Next Generation; 3.1.9 Convergence; 3.2 A Parting Look; Bibliography; Exercises; 4 Basic Applications; 4.1 "Mary Had a Little Lamb"; 4.2 Algorithmic Creativity-Genetic Art; 4.3 Word Guess; 4.4 Locating an Emergency Response Unit; 4.5 Antenna Array Design; 4.6 The Evolution of Horses; 4.5 Summary; Bibliography; 5 An Added Level of Sophistication; 5.1 Handling Expensive Cost Functions; 5.2 Multiple Objective Optimization; 5.2.1 Sum of Weighted Cost Functions; 5.2.2 Pareto Optimization 5.3 Hybrid GA5.4 Gray Codes; 5.5 Gene Size; 5.6 Convergence; 5.7 Alternative Crossovers for Binary GAs; 5.8 Population; 5.9 Mutation; 5.10 Permutation Problems; 5.11 Selecting GA Parameters; 5.12 Continuous versus Binary GA; 5.13 Messy Genetic Algorithms; 5.14 Parallel Genetic Algorithms; 5.14.1 Advantages of Parallel GAs; 5.14.2 Strategies for Parallel GAs; 5.14.3 Expected Speedup; 5.14.4 An Example Parallel GA; 5.14.5 How Parallel GAs Are Being Used; Bibliography; Exercises; 6 Advanced Applications; 6.1 Traveling Salesperson Problem; 6.2 Locating an Emergency Response Unit Revisited 6.3 Decoding a Secret Message6.4 Robot Trajectory Planning; 6.5 Stealth Design; 6.6 Building Dynamic Inverse Models-The Linear Case; 6.7 Building Dynamic Inverse Models-The Nonlinear Case; 6.8 Combining GAs with Simulations-Air Pollution Receptor Modeling; 6.9 Optimizing Artificial Neural Nets with GAs; 6.10 Solving High-Order Nonlinear Partial Differential Equations; Bibliography; 7 More Natural Optimization Algorithms; 7.1 Simulated Annealing; 7.2 Particle Swarm Optimization (PSO); 7.3 Ant Colony Optimization (ACO); 7.4 Genetic Programming (GP); 7.5 Cultural Algorithms 7.6 Evolutionary Strategies |
| Record Nr. | UNINA-9910830885403321 |
|
Haupt Randy L
|
||
| Hoboken, N.J., : John Wiley, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Practical genetic algorithms / / Randy L. Haupt, Sue Ellen Haupt
| Practical genetic algorithms / / Randy L. Haupt, Sue Ellen Haupt |
| Autore | Haupt Randy L |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : John Wiley, c2004 |
| Descrizione fisica | 1 online resource (273 p.) |
| Disciplina | 519.6/2 |
| Altri autori (Persone) | HauptS. E |
| Soggetto topico | Genetic algorithms |
| ISBN |
1-280-54212-8
9786610542123 0-471-67175-4 0-471-67174-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
PRACTICAL GENETIC ALGORITHMS; CONTENTS; Preface; Preface to First Edition; List of Symbols; 1 Introduction to Optimization; 1.1 Finding the Best Solution; 1.1.1 What Is Optimization?; 1.1.2 Root Finding versus Optimization; 1.1.3 Categories of Optimization; 1.2 Minimum-Seeking Algorithms; 1.2.1 Exhaustive Search; 1.2.2 Analytical Optimization; 1.2.3 Nelder-Mead Downhill Simplex Method; 1.2.4 Optimization Based on Line Minimization; 1.3 Natural Optimization Methods; 1.4 Biological Optimization: Natural Selection; 1.5 The Genetic Algorithm; Bibliography; Exercises
2 The Binary Genetic Algorithm2.1 Genetic Algorithms: Natural Selection on a Computer; 2.2 Components of a Binary Genetic Algorithm; 2.2.1 Selecting the Variables and the Cost Function; 2.2.2 Variable Encoding and Decoding; 2.2.3 The Population; 2.2.4 Natural Selection; 2.2.5 Selection; 2.2.6 Mating; 2.2.7 Mutations; 2.2.8 The Next Generation; 2.2.9 Convergence; 2.3 A Parting Look; Bibliography; Exercises; 3 The Continuous Genetic Algorithm; 3.1 Components of a Continuous Genetic Algorithm; 3.1.1 The Example Variables and Cost Function; 3.1.2 Variable Encoding, Precision, and Bounds 3.1.3 Initial Population3.1.4 Natural Selection; 3.1.5 Pairing; 3.1.6 Mating; 3.1.7 Mutations; 3.1.8 The Next Generation; 3.1.9 Convergence; 3.2 A Parting Look; Bibliography; Exercises; 4 Basic Applications; 4.1 "Mary Had a Little Lamb"; 4.2 Algorithmic Creativity-Genetic Art; 4.3 Word Guess; 4.4 Locating an Emergency Response Unit; 4.5 Antenna Array Design; 4.6 The Evolution of Horses; 4.5 Summary; Bibliography; 5 An Added Level of Sophistication; 5.1 Handling Expensive Cost Functions; 5.2 Multiple Objective Optimization; 5.2.1 Sum of Weighted Cost Functions; 5.2.2 Pareto Optimization 5.3 Hybrid GA5.4 Gray Codes; 5.5 Gene Size; 5.6 Convergence; 5.7 Alternative Crossovers for Binary GAs; 5.8 Population; 5.9 Mutation; 5.10 Permutation Problems; 5.11 Selecting GA Parameters; 5.12 Continuous versus Binary GA; 5.13 Messy Genetic Algorithms; 5.14 Parallel Genetic Algorithms; 5.14.1 Advantages of Parallel GAs; 5.14.2 Strategies for Parallel GAs; 5.14.3 Expected Speedup; 5.14.4 An Example Parallel GA; 5.14.5 How Parallel GAs Are Being Used; Bibliography; Exercises; 6 Advanced Applications; 6.1 Traveling Salesperson Problem; 6.2 Locating an Emergency Response Unit Revisited 6.3 Decoding a Secret Message6.4 Robot Trajectory Planning; 6.5 Stealth Design; 6.6 Building Dynamic Inverse Models-The Linear Case; 6.7 Building Dynamic Inverse Models-The Nonlinear Case; 6.8 Combining GAs with Simulations-Air Pollution Receptor Modeling; 6.9 Optimizing Artificial Neural Nets with GAs; 6.10 Solving High-Order Nonlinear Partial Differential Equations; Bibliography; 7 More Natural Optimization Algorithms; 7.1 Simulated Annealing; 7.2 Particle Swarm Optimization (PSO); 7.3 Ant Colony Optimization (ACO); 7.4 Genetic Programming (GP); 7.5 Cultural Algorithms 7.6 Evolutionary Strategies |
| Record Nr. | UNINA-9910877619103321 |
|
Haupt Randy L
|
||
| Hoboken, N.J., : John Wiley, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||