Power Magnetic Devices. Scott D. Sudhoff

Figure 1.27 Sample design from Pareto‐optimal front.

      Unlike the case of single‐objective optimization, the clustering of all values of a gene to approximately the same value is not expected in multi‐objective optimization because the parameters will vary along the front. In order to illustrate this, consider the slot depth d_s. Observe that in Figure 1.27(a) it has a slightly downward slope while in Figure 1.27(b) it has a slightly upward slope. This is because as we move from a low‐mass high‐loss design to a high‐mass low‐loss design the slot depth decreases. The core depth w_c can be seen to be approximately constant.

      The remaining parameters undergo more interesting behaviors. Consider N^*, for example. Observe that in Figure 1.27(a), the nondominated solutions fall into two groups, which are indicated with a darker shaded and lighter shaded ellipses for lower and higher mass, respectively. The direction of decreasing mass is indicated with an arrow. Observe that the designs undergo a bifurcation indicated by a black vertical arrow. This can also be seen in Figure 1.27(b), wherein the sets are again circled. Note that the direction of decreasing mass is now to the left. The designs that are not in the two groups are dominated solutions. The bifurcation of the design space is also readily apparent in the slot width w_s, core length l_c, and air gap g. Such bifurcations in the design space can be the result of the change of a discrete variable, or the result of the design space moving into or out of a constraint. In this example, if we replace (10.1‐1) with N = N^*, the bifurcation disappears. Of course, in doing this, our problem becomes strictly mathematical in nature since N must be an integer in practice.

References

      1 1 E. K. Chong and S. H. Zak, An Introduction to Optimization, third edition. Hoboken: John Wiley & Sons, Inc., 2008.

      2 2 J. F. Crow, Genetics Notes. New York: Macmillan Publishing Company, 1983.

      3 3 J. H. Holland, Adaptation in Natural and Artificial Systems, Boston: MIT Press, 1992.

      4 4 D. E. Goldberg, Genetic Algorithms in Search, Optimization, & Machine Learning. Boston: Addison Wesley Longman, Inc., 1989.

      5 5 D. E. Goldberg, The Design of Innovation. Boston: Kluwer Academic Publishers, 2002.

      6 6 S. D. Sudhoff, MATLAB codes for Power Magnetic Devices: A Multi‐Objective Design Approach, second edition. Available: http://booksupport.wiley.com.

      7 7 B. N. Cassimere and S. D. Sudhoff, Population based design of a permanent magnet synchronous machine, IEEE Transactions on Energy Conversion, vol. 24, no. 2, pp. 347–357, 2009.

      8 8 Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, third, revised and extended edition. Berlin: Springer‐Verlag, 1999.

      9 9 A. Osyczka, Evolutionary Algorithms for Single and Multicriteria Design Optimization. Heidelberg: Physica‐Verlag, 2002.

      10 10 G. P. Liu, J. B. Yang and J. F. Whidborne, Multiobjective Optimization and Control. Exeter: Research Studies Press Ltd., 2003.

      11 11 K. Deb, Multi‐Objective Optimization using Evolutionary Algorithms. Chichester: John Wiley & Sons, Ltd., 2001.

Problems

      1 It is desired to minimize the functionWhat is a possible fitness function (the answer is not unique) if using a canonical GA?

      2 The fitness values of the members of a population are 23, 96, 42, 12, 8, 7, and 47. What is the expected number of times the individual with a fitness of 42 will appear in the mating pool? Use roulette wheel selection.

      3 Consider two parents, with x1 = 0.2 and x2 = 0.5. Consider simulated binary crossover with ηc = 1. Form 105 children, and plot a histogram of the children arranged in 20 equally spaced bins on the interval 0 to 1. Implement gene repair using ring mapping.

      4 Repeat Problem 3 with x2 = 0.25.

      5 Suppose a design problem was coded with five genes on a single chromosome, and single‐point crossover was used. During the crossover between two parents, how many different children (in terms of genotype) could be produced?

      6 A logarithmically mapped gene has a range from 10−3 to 106. If the value for this gene for a particular individual is 37.6, what is its’ normalized value? What would its’ normalized value be if it were linearly mapped.

      7 During an evolution, the minimum, maximum, and average fitness of a population is 1.2, 270, and 40, respectively. If the most fit individual is to be three times more likely than the average fit individual to be selected, and the least fit individual is 1/3 as likely as the average fit individual to be selected, what is the scaled fitness of an individual whose raw fitness is 58.

      8 Below are the objective function values for an inductor design. It is desired to minimize both objectives.Individual123456Mass (kg)531424Loss (kW)236541Use Kung’s algorithm to identify the nondominated individuals.

      9 Consider Problem 8. Compute the crowding distance of all nondominated individuals.