Power Magnetic Devices. Scott D. Sudhoff. Читать онлайн. Newlib. NEWLIB.NET

Автор: Scott D. Sudhoff
Издательство: John Wiley & Sons Limited
Серия:
Жанр произведения: Техническая литература
Год издания: 0
isbn: 9781119674634
Скачать книгу
10 images 8.00 images images

      Newton’s method can be extremely effective on some problems, but prove problematic on others. For example, if f(x) is not twice differentiable for some x, difficulties arise since Newton’s method requires the function, its gradient, and its Hessian. Many optimization methods require similar information and share similar drawbacks. There are optimization methods that do not require derivative information. One example is the Nelder–Mead simplex method. Even so, this algorithm can still become trapped at local minimizers if the function is not convex.

      One feature that makes these methods susceptible to becoming trapped at a local minimum is that they take the approach of starting with a single estimated solution and attempt to refine that estimate. If the single estimate is close to a local extrema, it will tend to converge to that extrema. There is another class of optimization methods that are not based on a single estimate of the solution but on a large number (a population) of estimates. These population‐based methods are not as susceptible to convergence to a nonglobal local extrema because there are a multitude of candidate optimizers.

      Genetic algorithms (GAs) are a population‐based optimization algorithms that have proven very effective in solving design optimization problems. Other population‐based optimization methods, such as particle swarm optimization, have also been used successfully. While one can engage in a lengthy debate over which algorithm is superior, such a debate is unlikely to be fruitful. The focus of this text is on posing the design problem as a formal optimization problem; once the problem is so posed, any optimization algorithm can be used. A discussion of GAs is included herein in order to provide the reader with a background in at least one method that can be used for the optimization process.

Schematic illustration of deoxyribonucleic acid (DNA).

      Each DNA molecule in a living organism is known as a chromosome. Living organisms generally have multiple chromosomes. For example, humans have 46 chromosomes per cell. These chromosomes are arranged into 22 pairs (one of each pair contributed by the father and one of each pair contributed by the mother). In addition, there are the two sex chromosomes denoted as X and Y. In humans and many other organisms, the existence of chromosomes in pairs leads to dominant and recessive genes, as discovered by Gregory Mendel, a Roman Catholic monk and botanist, who studied the propagation of traits in pea plants. However, not all living creatures have chromosomes organized in pairs; ants, wasps, and bees are haploid and have only one occurrence of each chromosome, while strawberries are octaploid with eight occurrences of each chromosome. This provides something to contemplate while eating strawberry pie.

Schematic illustration of meiosis.

      Of course, in the case of humans, chromosome distribution alone with 23 pairs of chromosomes, yields 223 = 8,388,608 genotypes for the gametes. A set of parents could thus produce 8,388,6082 genetically different children, which would seem to be an impressively diverse set, even without crossover. However, in artificial GAs, the number of chromosomes is much smaller, often consisting of a single chromosome.