<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">42286</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.042286</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm</article-title>
<alt-title alt-title-type="left-running-head">Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm</alt-title>
<alt-title alt-title-type="right-running-head">Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Wang</surname><given-names>Dazhi</given-names></name><email>ProDZW@126.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Pan</surname><given-names>Pengyi</given-names></name></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Niu</surname><given-names>Bowen</given-names></name></contrib>
<aff><institution>College of Information Science and Engineering, Northeastern University</institution>, <addr-line>Shenyang, 110819</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Dazhi Wang. Email: <email>ProDZW@126.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic"><year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>29</day><month>11</month><year>2023</year></pub-date>
<volume>77</volume>
<issue>2</issue>
<fpage>1535</fpage>
<lpage>1555</lpage>
<history>
<date date-type="received">
<day>25</day><month>5</month><year>2023</year>
</date>
<date date-type="accepted">
<day>23</day><month>8</month><year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Wang, Pan and Niu</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Wang, Pan and Niu</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_42286.pdf"></self-uri>
<abstract>
<p>The permanent magnet eddy current coupler (PMEC) solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems. It provides torque to the load and generates heat and losses, reducing its energy transfer efficiency. This issue has become an obstacle for PMEC to develop toward a higher power. This paper aims to improve the overall performance of PMEC through multi-objective optimization methods. Firstly, a PMEC modeling method based on the Levenberg-Marquardt back propagation (LMBP) neural network is proposed, aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC. Then, a novel competition mechanism-based multi-objective particle swarm optimization algorithm (NCMOPSO) is proposed to find the optimal structural parameters of PMEC. Chaotic search and mutation strategies are used to improve the original algorithm, which improves the shortcomings of multi-objective particle swarm optimization (MOPSO), which is too fast to converge into a global optimum, and balances the convergence and diversity of the algorithm. In order to verify the superiority and applicability of the proposed algorithm, it is compared with several popular multi-objective optimization algorithms. Applying them to the optimization model of PMEC, the results show that the proposed algorithm has better comprehensive performance. Finally, a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results. Compared with the prototype, the optimized PMEC has reduced eddy current losses by 1.7812 kW, increased output torque by 658.5 N&#x00B7;m, and decreased costs by 13%, improving energy transfer efficiency.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Competition mechanism</kwd>
<kwd>Levenberg-Marquardt back propagation neural network</kwd>
<kwd>multi-objective particle swarm optimization algorithm</kwd>
<kwd>permanent magnet eddy current coupler</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>52077027</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The permanent magnet eddy current coupler (PMEC) is a kind of equipment that uses the force between magnetic fields to transfer torque and whose outstanding feature is no mechanical connection. This noncontact structure has the benefits of vibration isolation, alignment error tolerance, and overload protection while lowering friction and equipment loss [<xref ref-type="bibr" rid="ref-1">1</xref>]. When PMEC works, the induced eddy current in the conductor provides torque for the load. However, it also causes heat to be produced and energy to be lost, which lowers the effectiveness of energy transfer. Multi-objective optimization is an excellent method to balance the transmission performance and eddy current loss of PMEC. A trustworthy model is required to predict the performance of PMEC throughout the optimization process [<xref ref-type="bibr" rid="ref-2">2</xref>].</p>
<p>There are three common modeling methods for PMEC. The first is to use the method of separating variables to solve partial differential equations based on Maxwell equations and boundary conditions [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-8">8</xref>]. The second is to build an equivalent magnetic circuit (EMC) based on the similarity between the magnetic circuit and the circuit and then solve it according to Kirchhoff&#x2019;s law and Ohm&#x2019;s law of the magnetic circuit [<xref ref-type="bibr" rid="ref-9">9</xref>&#x2013;<xref ref-type="bibr" rid="ref-13">13</xref>]. The influence of eddy currents should be considered in the modeling process of PMEC. However, EMC is a method that does not consider eddy current, and the existing EMC models cannot directly calculate eddy current effects [<xref ref-type="bibr" rid="ref-10">10</xref>]. Although the calculations for these two methods are simple, the modeling process necessitates several assumptions and simplifications, as well as the application of numerous empirical components, which causes the calculation results from the model to diverge from the actual scenario. Additionally, these models often predict the performance of PMEC with reasonable accuracy at low relative slips, but as relative slip increases, the accuracy of the models rapidly decreases [<xref ref-type="bibr" rid="ref-14">14</xref>]. The third method is the numerical method, such as the finite element method (FEM), which enables the analysis of electromagnetic field problems from the classical analytical method to the numerical analysis method of discrete systems so that high-precision discrete solutions can be obtained [<xref ref-type="bibr" rid="ref-15">15</xref>&#x2013;<xref ref-type="bibr" rid="ref-17">17</xref>]. The FEM can produce accurate results, but because of its extensive calculation and time requirement, it is often used for verification. Neural networks are frequently used for numerical prediction in complex situations. There are, however, few studies that use neural networks to predict PMEC performance. In light of this, this paper suggests a Levenberg-Marquardt back propagation (LMBP) neural network-based modeling approach for PMEC.</p>
<p>Numerous intelligent optimization algorithms have been used to address the multi-objective optimization of electromagnetic equipment. References [<xref ref-type="bibr" rid="ref-2">2</xref>] and [<xref ref-type="bibr" rid="ref-18">18</xref>] used the genetic algorithm (GA) to carry out multi-objective optimization for dual-sided radial PMEC and radial flux permanent magnet motors. Reference [<xref ref-type="bibr" rid="ref-19">19</xref>] has optimized and designed the inner-mounted permanent magnet synchronous motor (IPMSM) by correlating the particle swarm optimization algorithm (PSO) with the FEM. References [<xref ref-type="bibr" rid="ref-20">20</xref>] and [<xref ref-type="bibr" rid="ref-21">21</xref>] used an improved PSO to optimize the energy consumption of tram operations. However, these methods use weighted methods to integrate multiple objective functions into one. The solutions obtained in these ways are closely related to the defined weights and have high subjectivity. To address the issues raised above, references [<xref ref-type="bibr" rid="ref-22">22</xref>&#x2013;<xref ref-type="bibr" rid="ref-24">24</xref>] adopted multi-objective particle swarm optimization (MOPSO) based on Pareto optimal sequencing. Although they proposed various MOPSO improvement strategies, finding a globally optimal solution is still challenging since diversity and convergence are tricky to balance.</p>
<p>This paper aims to investigate the multi-objective optimization design method of PMEC structural parameters to simultaneously improve transmission performance, suppress eddy current loss, and lower material cost. A PMEC modeling method based on the LMBP neural network is proposed. The nonlinear regression model of PMEC is established in the whole space to compensate for the theoretical model&#x2019;s low accuracy, which combines the ANSYS simulation data with the LMBP neural network. Then, to balance the convergence and diversity of MOPSO, the novel competitive mechanism-based multi-objective particle swarm optimization algorithm (NCMOPSO) is proposed and applied to the parameter optimization of PMEC. This method can calculate all feasible nondominated optimal solutions, avoiding the subjectivity and complexity of the objective function mechanism caused by the weighting method. Chaotic search and mutation strategies are used to enhance the diversity of the population, which improves the problem of a too-fast rate of convergence of the algorithm. Finally, the LMBP model&#x2019;s accuracy and the optimization algorithm&#x2019;s effectiveness are verified by MATLAB and finite element simulation, respectively.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>LMBP Neural Network Model of PMEC</title>
<sec id="s2_1">
<label>2.1</label>
<title>Structure and Working Principle of PMEC</title>
<p>The mechanical structure of PMEC with a single-group disk structure is shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The conductor rotor and PM rotor can rotate independently. When PMEC works, the conductor rotor is driven by a motor to rotate, cutting off the magnetic induction lines generated by PM and forming eddy currents. Near the conductor disk, eddy current, in turn, generates an induced magnetic field. According to Lenz&#x2019;s law, the eddy current magnetic field should prevent the relative movement between the PM rotor and the conductor rotor by preventing the change of magnetic flux caused by the eddy current. Under the interaction between the eddy current magnetic field and the permanent magnetic field, the PM rotor lags behind the conductor rotor, which realizes the torque transfer from the motor to the load.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Mechanical structure of PMEC</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-1.tif"/>
</fig>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Levenberg-Marquardt Back Propagation Neural Network</title>
<p>The neural network can approximate arbitrary complex nonlinear systems. The BP neural network based on the gradient descent (GD) method is the most successful and widely used neural network learning algorithm [<xref ref-type="bibr" rid="ref-25">25</xref>]. However, its slow convergence speed makes it easy to fall into local extreme values. The LMBP neural network uses the Levenberg-Marquardt (LM) algorithm instead of the GD method to solve the optimization problem. It combines the GD and Gauss-Newton methods and benefits from their global characteristics and efficient convergence. Moreover, it has advantages in solving various nonlinear problems [<xref ref-type="bibr" rid="ref-26">26</xref>]. The formula for the modified weight is as follows:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>J</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>u</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msup><mml:mi>J</mml:mi><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the Jacobian matrix, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the network error vector, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>I</mml:mi></mml:math></inline-formula> is the identity matrix, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>u</mml:mi></mml:math></inline-formula> is the damping term. The objective function is the square error function, as shown in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>.</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the error between the <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> predicted value and the actual value.</p>
<p>If <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, the LM algorithm becomes a Gauss-Newton method using an approximate Hessian matrix. If <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>u</mml:mi></mml:math></inline-formula> is large, it becomes a small step GD. The purpose of the LM algorithm is to convert to the Newton method as quickly as possible. Since it converges faster and has higher accuracy near the minimum error point. If an iteration succeeds and the error performance function decreases, then the value of <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>u</mml:mi></mml:math></inline-formula> will be reduced. If the iteration fails, the value of <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>u</mml:mi></mml:math></inline-formula> will be increased. In this way, error performance can be minimized with iteration.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Modeling of PMEC Based on LMBP Neural Network</title>
<sec id="s2_3_1">
<label>2.3.1</label>
<title>Determination of Input and Output of the Model</title>
<p>PMEC is a complex multivariable coupling input and output system. The main structural parameters affecting the PMEC output performance are the thickness of the copper disk and the thickness, length, and width of the PM. Therefore, these four variables are selected as the model&#x2019;s input variables. The model&#x2019;s output variables are the PMEC&#x2019;s output torque and eddy current loss. The impact of input variables on output variables is analyzed as follows:
<list list-type="bullet">
<list-item>
<p>Copper disk thickness: During operation, the copper disk generates an eddy current and provides a flow circuit for the eddy current. Its thickness will directly affect the resistance in the eddy current circuit and then affect the eddy current loss and output torque.</p></list-item>
<list-item>
<p>The volume of PM: Increasing PM volume will inevitably result in rising magnetic flux and magnetic potential. However, at the same time, the magnetic resistance and leakage in the magnetic circuit will also increase, consuming the increased magnetic potential and decreasing the remaining magnetic flux of PM. The growth rate is reducing while the output torque and eddy current loss are rising.</p></list-item>
</list></p>
<p>The LMBP neural network model structure of PMEC is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure of PMEC neural network model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-2.tif"/>
</fig>
</sec>
<sec id="s2_3_2">
<label>2.3.2</label>
<title>Sample Point Selection and Pretreatment</title>
<p>The accuracy of sample data determines the reliability of neural network modeling. Establish a PMEC model using ANSYS Maxwell software. Conduct finite element simulation to obtain relevant data on its torque characteristics and eddy current loss as the LMBP neural network training samples.</p>
<p>This paper takes a 30 kW PMEC as an example, and <xref ref-type="table" rid="table-1">Table 1</xref> shows the prototype parameters. According to the parameters, establish its three-dimensional finite element simulation model. Through finite element calculation, the influence of four input variables of PMEC on torque performance and eddy current loss is shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Prototype parameters of PMEC</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Value</th>
<th>Parameter</th>
<th>Value</th>
</tr>
</thead>
<tbody>
<tr>
<td>Number of pole-pairs</td>
<td>9</td>
<td>Length of pm</td>
<td>130 mm</td>
</tr>
<tr>
<td>Thickness of pm</td>
<td>33 mm</td>
<td>Width of pm</td>
<td>65 mm</td>
</tr>
<tr>
<td>Copper disk inner radius</td>
<td>190 mm</td>
<td>Copper disk thickness</td>
<td>9 mm</td>
</tr>
<tr>
<td>Copper disk outer radius</td>
<td>370 mm</td>
<td>Back iron inner radius</td>
<td>190 mm</td>
</tr>
<tr>
<td>Thickness of back iron</td>
<td>15 mm</td>
<td>Back iron outer radius</td>
<td>370 mm</td>
</tr>
<tr>
<td>Width of air gap</td>
<td>4 mm</td>
<td>Relative slip</td>
<td>45 rpm</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Influence of input variables on output torque and eddy current loss</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-3.tif"/>
</fig>
<p>To ensure assembly, the influence of material strength, performance, and heat dissipation is comprehensively considered. The range of input variables is shown in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Range of input variables of the PMEC model</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Input variable</th>
<th>Range</th>
<th>Input variable</th>
<th>Range</th>
</tr>
</thead>
<tbody>
<tr>
<td>Thickness of copper disk</td>
<td>4&#x2013;12 mm</td>
<td>Thickness of pm</td>
<td>10&#x2013;50 mm</td>
</tr>
<tr>
<td>Length of pm</td>
<td>115&#x2013;155 mm</td>
<td>Width of pm</td>
<td>60&#x2013;70 mm</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Because the units and order of magnitude of the input parameters are inconsistent, the parameters are normalized using the following equation to remove discrepancies:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>y</mml:mi></mml:math></inline-formula> represents the processed data, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>x</mml:mi></mml:math></inline-formula> represents the original sample data, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> represents the maximum value of the sample data, and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> represents the minimum value of the sample data.</p>
</sec>
<sec id="s2_3_3">
<label>2.3.3</label>
<title>Neural Network Topology and Parameter Selection</title>
<p>The LMBP neural network has an unknown number of hidden layers and hidden layer nodes. Therefore, it is necessary to determine a more appropriate value through experiments. Since the model parameters in this study are not complicated, the number of hidden layers is determined to be one according to the Kolmogorov theorem. The range of hidden layer node points can generally be obtained from the empirical equation:</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:msqrt><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of hidden nodes, <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the number of input nodes, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the number of output nodes, and the range of <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mn>1</mml:mn><mml:mo>&#x003C;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>10</mml:mn></mml:math></inline-formula>.</p>
<p>The number of input layer nodes equals the number of input variables, which is 4. The output variable is the eddy current loss or output torque, so the number of output nodes should be 1. According to <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, the number of hidden layer nodes ranges from 3 to 12. Experiments on models with different hidden layer nodes yield the corresponding number of iterations and mean square error (MSE) to select the optimal setting value. The experimental results are shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The training outcomes of each model are the average after ten pieces of training to ensure the reliability of the experimental results.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Number of neurons in the hidden layer, number of iterations and MSE</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-4.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="fig-4">Fig. 4a</xref> that the model of output torque and eddy current loss is optimal when the hidden layer nodes are 10 and 11, respectively.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Verification of the Established Mode</title>
<sec id="s3_1">
<label>3.1</label>
<title>Model Training and Result Comparison</title>
<p>The input variables of the neural network are the thickness of the copper disk and the thickness, length, and width of the PM, while the output is the output torque or eddy current loss. Train and test based on 530 data sets obtained from finite element calculations. Among them, four hundred twenty-four data groups are randomly assigned as a sample set for training. Fifty-three data groups are used as validation data sets, and the remaining 53 are used as test sets for post-training tests.</p>
<p>The LMBP and standard BP neural networks are trained under the same conditions to compare the training effect. <xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the change in MSE in both training processes.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The learning curve of the neural network</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-5.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="fig-5">Fig. 5</xref> that compared to the standard BP neural network, the LMBP neural network has a faster convergence speed and higher training accuracy. Use the test set to compare the MSE of the two prediction results, and its prediction results are significantly better.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Error Analysis of the Model</title>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the regression analysis of output torque and eddy current loss data. Almost all sample points are near the zero-error line, indicating that the regression line fits the observed values well and that the trained model is accurate and reliable.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Regression analysis diagram of output torque and eddy current loss data</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-6.tif"/>
</fig>
<p>To test the training network&#x2019;s generalization ability, select 70% of the samples as training samples and the balance as verification samples. Train the LMBP neural network with training samples, and test the generalization ability of the trained LMBP neural network with validation samples. The network model is run ten times under identical conditions. The projected output values are then statistically analyzed, and their MSE is calculated.</p>
<p><xref ref-type="table" rid="table-3">Table 3</xref> shows the maximum, minimum, and average MSE values in the 10 test results of the LMBP neural network and the standard BP neural network. The PMEC model established using the LM algorithm to improve the BP neural network has superior prediction accuracy and generalization capacity. Furthermore, the modeling results based on standard BP neural networks fluctuate more violently. In the output torque and eddy current loss model of PMEC, the difference between the maximum and minimum MSE values of the standard BP neural network is 0.0103 and 0.4791, respectively, while the difference based on LMBP neural network modeling is only 0.0003244 and 0.0106, respectively. Therefore, the prediction output based on LMBP neural network modeling is more stable.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>MSE of two kinds of neural networks</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="4">(a) Output torque</th>
</tr>
<tr>
<th>MSE</th>
<th>Maximum</th>
<th>Minimum</th>
<th>Average value</th>
</tr>
</thead>
<tbody>
<tr>
<td>BP</td>
<td>0.012</td>
<td>0.0017</td>
<td>0.00546</td>
</tr>
<tr>
<td>LMBP</td>
<td>0.0008419</td>
<td>0.0005175</td>
<td>0.0006492</td>
</tr>
<tr>
<td align="center" colspan="4">(b) Eddy current loss</td>
</tr>
<tr>
<td>MSE</td>
<td>Maximum</td>
<td>Minimum</td>
<td>Average value</td>
</tr>
<tr>
<td>BP</td>
<td>0.5629</td>
<td>0.0838</td>
<td>0.17973</td>
</tr>
<tr>
<td>LMBP</td>
<td>0.0191</td>
<td>0.0085</td>
<td>0.01196</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Multi-Objective Optimization Design of PMEC</title>
<sec id="s4_1">
<label>4.1</label>
<title>Novel Competitive Mechanism-Based MOPSO</title>
<p>In MOPSO, the diversity of the population mainly comes from the difference between personal optimum and global optimum. Due to the global influence of the global optimum, the personal optimum may be similar to it or even have the same value, resulting in a reduction in population diversity [<xref ref-type="bibr" rid="ref-27">27</xref>]. In order to eliminate their impact on diversity, a competition mechanism is introduced to improve MOPSO.</p>
<sec id="s4_1_1">
<label>4.1.1</label>
<title>Competitive Swarm Optimizer (CSO)</title>
<p>CSO introduces the survival competition mechanism of the fittest in biology based on PSO. In each iteration, particles are not updated with their personal and global optimums. Instead, they are randomly paired for comparison and update the loser with the winner&#x2019;s information, thereby avoiding premature convergence and increasing the variety of the population.</p>
<p>Take the minimization problem as an example. First, initialize a population <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> containing <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>N</mml:mi></mml:math></inline-formula> particles, where <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>N</mml:mi></mml:math></inline-formula> is the population size and <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>t</mml:mi></mml:math></inline-formula> is the number of iterations. Randomly divide each generation&#x2019;s particle population <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> into <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>N</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:math></inline-formula> pairs. Then select a pair of particles to compete according to their fitness values. Those particles with smaller fitness values are called winners and will enter the next generation <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> directly. The losers with large fitness values must learn from the winners to update their position and velocity vectors to enter the next generation. One iteration has been completed when all particles are transferred to the next generation.</p>
<p>The updated formulas for the velocity vector and position vector of the loser after the competition are as follows:</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>X</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> respectively represent the position vector and velocity vector of the winner and loser in the <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> round of iteration <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>t</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are three random vectors distributed in <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mover><mml:mi>X</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the average position value of all contemporary particles, and <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula> is the control parameter to adjust the influence of <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mover><mml:mi>X</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec id="s4_1_2">
<label>4.1.2</label>
<title>Motivation and Framework of NCMOPSO</title>
<p>Although CSO can improve the diversity of PSO, there are several limitations. First, the diversity of winners in the parent generation has not improved. Because winners directly enter offspring without position updating. Chaotic search can be used to deal with the winners because chaotic dynamics have the characteristics of ergodicity, randomness, and irregularity. Second, if the parent population lacks diversity, the population will converge prematurely. Therefore, the mutation strategy can be used to avoid the population falling into a local optimum.</p>
<p>Algorithm 1 shows the framework of the NCMOPSO. Its major cycle mainly includes an update strategy based on the novel competition mechanism and environmental selection. They will be detailed in the following sections.</p>
<fig id="fig-17">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-17.tif"/>
</fig>
</sec>
<sec id="s4_1_3">
<label>4.1.3</label>
<title>The Novel Competition Mechanism</title>
<p>The proposed competition mechanism includes pairwise competition, particle update, and mutation. In pairwise competition, the population <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is randomly divided into <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>N</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:math></inline-formula> pairs. Then, compare the dominance relationship between the two particles in each pair according to the Pareto dominance relationship. If one particle can dominate the other, the dominant particle is the winner. If the two particles are nondominated by each other, select the winner according to the crowding distance ranking in the nondominated sorting genetic algorithm-II (NSGA-II) [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
<p>After the winner is determined, the loser&#x2019;s position vector and velocity vector are updated by learning from the winner. The updated equations are <xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> and <xref ref-type="disp-formula" rid="eqn-6">(6)</xref> in CSO. In order to improve the diversity of the winners, an update strategy was designed based on a chaotic search. It is based on the well-known logistic equation [<xref ref-type="bibr" rid="ref-29">29</xref>], which is defined as:</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x22EF;</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is a variable, and <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> is a control parameter. When <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>&#x03BC;</mml:mi><mml:mo>=</mml:mo><mml:mn>4</mml:mn></mml:math></inline-formula>, an utterly chaotic sequence can be iterated from any initial value <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>The primary measure to update the winner is to use the ergodicity of chaotic dynamics to search for the winner and generate chaotic sequences. The process of chaotic search is defined as:</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> chaotic variable, <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>m</mml:mi></mml:math></inline-formula> represents the number of chaotic search iterations, and <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> distribution in [0,1] requires <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. After each competition, the winner particle is iterated <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>M</mml:mi></mml:math></inline-formula> times using <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref> to generate a chaotic sequence of size <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>M</mml:mi></mml:math></inline-formula>. Calculate the fitness value and crowding distance of particles in the chaotic sequence, and then select the best particle to update the original winner.</p>
<fig id="fig-18">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-18.tif"/>
</fig>
<p>The rapid convergence of MOPSO may cause the population to gather around some particles or a specific area prematurely, thus losing diversity. Therefore, after the particles are updated, a time-varying mutation strategy is designed to mutate the particles based on the idea of [<xref ref-type="bibr" rid="ref-30">30</xref>]. The mutation formula is shown below:</p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mi>t</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mfrac><mml:mn>5</mml:mn><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the probability of mutation, <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> is the maximum number of iterations, <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mi>t</mml:mi></mml:math></inline-formula> is the current number of iterations, <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the random number subject to the Gaussian distribution with a mean value of 0 and variance of 1, <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mi>u</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are the upper bound and lower bound of the <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> dimension decision variable respectively, and <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the mutation parameter.</p>
<p>The detailed process of the updating strategy based on the novel competition mechanism is shown in Algorithm 2.</p>
</sec>
<sec id="s4_1_4">
<label>4.1.4</label>
<title>Environmental Selection Strategy</title>
<p>During the initial iteration, few Pareto optimal solutions will lead to poor competitiveness and convergence. However, a too-large Pareto optimal solution set in the later iteration period will lead to insufficient diversity. The angle-penalty distance (APD) proposed in the reference vector-guided evolutionary algorithm (RVEA) [<xref ref-type="bibr" rid="ref-31">31</xref>] can dynamically balance convergence and diversity in the optimization process according to the number of targets and the number of iterations. The APD between reference vectors and particles in RVEA is calculated as the following equation:</p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:munder><mml:mrow><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>D</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>t</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mfrac><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x27E9;</mml:mo></mml:mrow><mml:mrow><mml:munder><mml:mo form="prefix">min</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x27E9;</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mi>D</mml:mi></mml:math></inline-formula> is the dimension of the target space, <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:mi>R</mml:mi></mml:math></inline-formula> is the set of reference vectors, <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mi>t</mml:mi></mml:math></inline-formula> is the number of iterations, and <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> is the maximum number of iterations. <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the target vector of the particle <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x27E9;</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x27E9;</mml:mo></mml:mrow></mml:math></inline-formula> are the angles between <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:mi>r</mml:mi></mml:math></inline-formula>, and between <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mi>s</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:mi>r</mml:mi></mml:math></inline-formula>, respectively.</p>
<fig id="fig-19">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-19.tif"/>
</fig>
<p>The environmental selection proposed in RVEA can be used based on constraining the size of the nondominant solution set. When the size of the nondominant solution set is smaller than <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>, the nondominant solution and parent directly enter the next generation. When the size of the nondominant solution set is larger than <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>, the new nondominant solution set is determined through the environmental selection of the RVEA algorithm. The study of Pareto optimal solution set size constraints in adaptive competitive multi-objective swarm algorithm based on inverse modeling [<xref ref-type="bibr" rid="ref-32">32</xref>] shows that the effect is best when <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>20</mml:mn></mml:math></inline-formula>. Algorithm 3 shows the details of the environmental selection strategy.</p>
</sec>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Multi-Objective Optimization Model of PMEC</title>
<p>According to the analysis of different structural parameters in <xref ref-type="sec" rid="s2">Chapter 2</xref>, the thickness of the copper disk and the thickness, length, and width of the PM are selected as decision variables. The optimization goal is to increase output torque while decreasing eddy current loss and cost. The LMBP neural network fits the fitness functions of output torque and eddy current loss. The cost is also of great significance in the design of PMEC, mainly from the copper disk, PM, and back iron materials. In order to simplify the calculation, it is assumed that the price of the PM is ten times the price of the copper disk and the back iron. Then the approximate fitness function of the cost can be expressed as:</p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mn>10</mml:mn><mml:mi>v</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>v</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mi>W</mml:mi><mml:mo>+</mml:mo><mml:mn>10</mml:mn><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>4</mml:mn><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the average radius of the copper disk of PMEC, <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the number of permanent magnets, <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the width of the thickness of the copper disk, <inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are the thickness, length, and width of PM, respectively, and <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the thickness of the back iron.</p>
<p>There is the multi-objective optimization model of PMEC:</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>min</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;</mml:mtext><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mn>.2</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>max</mml:mi><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;</mml:mtext><mml:mn>4</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>12</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>min</mml:mi><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;</mml:mtext><mml:mn>10</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>50</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mtext>&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;&#x2009;</mml:mtext><mml:mn>25</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>75</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the functional relationship of PMEC eddy current loss and output torque concerning decision variables established by the LMBP neural network, respectively, and <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the functional relationship between PMEC cost and decision variables. <xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows the specific optimization process for PMEC.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Flow chart of the optimization process</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-7.tif"/>
</fig>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Optimization Results and Analysis</title>
<p>In order to verify the performance of NCMOPSO, it is compared with the popular NSGA-II [<xref ref-type="bibr" rid="ref-28">28</xref>], dominance-weighted uniformity (DWU) multi-objective evolutionary algorithm [<xref ref-type="bibr" rid="ref-33">33</xref>], direction-guided evolutionary algorithm (DGEA) [<xref ref-type="bibr" rid="ref-34">34</xref>], and existing PSOs such as MOPSO with multiple search strategies (MMOPSO) [<xref ref-type="bibr" rid="ref-35">35</xref>], speed-constrained multi-objective particle swarm optimization (SMPSO) [<xref ref-type="bibr" rid="ref-36">36</xref>], multi-objective particle swarm optimization algorithm based on decomposition (MPSOD) [<xref ref-type="bibr" rid="ref-37">37</xref>], and MOPSO [<xref ref-type="bibr" rid="ref-38">38</xref>]. To be fair, the parameters used in the comparison algorithm are the original paper&#x2019;s recommended values. <xref ref-type="table" rid="table-4">Table 4</xref> shows the parameters of the proposed NCMOPSO.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>The parameters of the proposed NCMOPSO</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Symbol</th>
<th>Quantity</th>
<th>Value</th>
<th>Symbol</th>
<th>Quantity</th>
<th>Value</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:mi>N</mml:mi></mml:math></inline-formula></td>
<td>Population size</td>
<td>200</td>
<td><inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Maximum number of iterations</td>
<td>1000</td>
</tr>
<tr>
<td><inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula></td>
<td>Control parameter</td>
<td>0.05</td>
<td><inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:mi>M</mml:mi></mml:math></inline-formula></td>
<td>Chaotic sequence size</td>
<td>50</td>
</tr>
<tr>
<td><inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Probability of mutation</td>
<td>0.4</td>
<td><inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Variable parameter in mutation</td>
<td>0.5</td>
</tr>
<tr>
<td><inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula></td>
<td colspan="4">Size limit of the nondominated solution set in environmental selection</td>
<td>10</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The proposed NCMOPSO and seven other multi-objective optimization algorithms are applied to the optimization model of PMEC, and the resulting solution is shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Solution set obtained by proposed NCMOPSO and other optimization algorithms</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-8.tif"/>
</fig>
<p>In <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is eddy current loss, <inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is output torque, and <inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the cost of PMEC. The particle distribution in the solution set obtained by the proposed NCMOPSO is more uniform and extensive than that of other optimization algorithms, which indicates that it solves the problem of poor diversity in MOPSO to a certain extent.</p>
<p>To make a more comprehensive evaluation of the performance of NCMOPSO, the hypervolume (HV) indicator is used to evaluate the eight optimization algorithms. It can simultaneously evaluate the convergence and distribution of the solution set. Hv is a strictly monotonous evaluation index in the Pareto dominance relationship. The higher the HV value, the better the comprehensive performance of the algorithm. The expression of HV is:</p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>H</mml:mi><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mo>&#x222A;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>S</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula> represents the Lebesgue measure used to measure volume, <inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><mml:mrow><mml:mo>|</mml:mo><mml:mi>S</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> represents the size of the nondominated solution set, and <inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the super volume formed by the reference point and the <inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mrow><mml:mtext>th</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> solution in the solution set. The HV values of the proposed NCMOPSO and seven other multi-objective optimization algorithms are shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>The HV values of the proposed NCMOPSO and seven other optimization algorithms</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-9.tif"/>
</fig>
<p>The proposed NCMOPSO has the largest HV value, which shows that its comprehensive performance is the best. To sum up, the proposed algorithm effectively balances convergence and diversity.</p>
<p>In <xref ref-type="fig" rid="fig-10">Fig. 10</xref>, the solution set obtained by NCMOPSO optimization is compared with the structural parameters of the original PMEC. It is found that at point A, the eddy current loss is lower than the initial value, and the output torque is higher than the initial value, but the cost is also higher than the initial value; at point B, the eddy current loss and cost are lower than the initial value, but the output torque is lower than the initial value; at point C, the output torque is higher than the initial value, and the cost is lower than the initial value, but the eddy current loss is higher than the initial value.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Comparison between the solution set obtained by NCMOPSO and the prototype value</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-10.tif"/>
</fig>
<p>It can be concluded that these three objective functions of eddy current loss, output torque, and cost are conflicting and cannot be optimized simultaneously. A better goal will lead to a worse goal. Select a compromise solution from the solution set as the optimization result, as shown in <xref ref-type="table" rid="table-5">Table 5</xref>. Compared with the prototype, the optimization results show that the output torque increases while the eddy current loss and cost are reduced, which can improve transmission performance while suppressing eddy current loss.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Optimization results</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Parameter</th>
<th>Optimization result</th>
<th>Prototype</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="4">Decision variables</td>
<td>Thickness of copper disk</td>
<td>6 mm</td>
<td>9 mm</td>
</tr>
<tr>
<td>Thickness of pm</td>
<td>30 mm</td>
<td>33 mm</td>
</tr>
<tr>
<td>Length of pm</td>
<td>145 mm</td>
<td>130 mm</td>
</tr>
<tr>
<td>Width of pm</td>
<td>68 mm</td>
<td>65 mm</td>
</tr>
<tr>
<td rowspan="3">Optimization objectives</td>
<td>Output torque</td>
<td>4.8766 kN&#x00B7;m</td>
<td>4.2284 kN&#x00B7;m</td>
</tr>
<tr>
<td>Eddy current loss</td>
<td>18.4297 kW</td>
<td>20.2122 kW</td>
</tr>
<tr>
<td>Cost</td>
<td>194.658</td>
<td>229.286</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To further validate the performance of NCMOPSO, compare the optimization results obtained with other PSO methods, as shown in <xref ref-type="table" rid="table-6">Table 6</xref>. When the obtained results are worse than NCMOPSO, deepen the data color. The optimization results obtained by NCMOPSO can dominate the results obtained by other PSO methods. They are the optimal solutions among all the results.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Comparison of optimization results between NCMOPSO and other PSOs</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Output torque</th>
<th>Eddy current loss</th>
<th>Cost</th>
</tr>
</thead>
<tbody>
<tr>
<td>NCMOPSO</td>
<td>4.8766 kN&#x00B7;m</td>
<td>18.4297 kW</td>
<td>194.658</td>
</tr>
<tr>
<td>MMOPSO</td>
<td>4.2413 kN&#x00B7;m</td>
<td>19.0657 kW</td>
<td>193.213</td>
</tr>
<tr>
<td>MOPSO</td>
<td>5.2174 kN&#x00B7;m</td>
<td>20.7742 kW</td>
<td>203.072</td>
</tr>
<tr>
<td>MPSOD</td>
<td>4.7176 kN&#x00B7;m</td>
<td>18.3295 kW</td>
<td>198.801</td>
</tr>
<tr>
<td>SMPSO</td>
<td>5.0504 kN&#x00B7;m</td>
<td>19.6476 kW</td>
<td>200.646</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The finite element simulation model is established using the optimized PMEC structural parameters, and then the electromagnetic characteristics of PMEC before and after optimization are analyzed.</p>
<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> compares eddy current loss and output torque before and after optimization. The eddy current loss and output torque of PMEC are improved after optimization. In addition, the fluctuation amplitude of the output is significantly reduced, which means that PMEC is more stable and its reliability has improved.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Eddy current loss and output torque before and after optimization</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-11.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-12">Fig. 12</xref> shows the distribution of magnetic induction intensity in the conductor disk before and after optimization. The optimized magnetic induction intensity distribution is more concentrated. The magnetic flux density is significantly increased and more concentrated in the area of the conductor disk corresponding to the PM, which is more conducive to increasing the dragging force between magnetic fields and improving the transmission torque.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Distribution map of magnetic induction intensity in conductor disk before and after optimization</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-12.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-13">Fig. 13</xref> shows the vector diagram of the eddy current density distribution in the conductor disk after and before optimization. The eddy current in the conductor disk of PMEC has an essential impact on its overall performance. Its induced magnetic field causes the PM and conductor rotor to rotate in the same direction, resulting in torque transfer. In addition, the heat generated by the eddy current in the conductor disk contributes significantly to PMEC power loss. By designing the structural parameters of PMEC, the eddy current path in the conductor disk was optimized. Reducing useless stray current in the eddy current circuit allows more eddy currents for torque transmission, which improves transmission efficiency and reduces eddy current losses.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Vector diagram of eddy current density distribution in conductor disk before and after optimization</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-13.tif"/>
</fig>
<p>In order to verify the accuracy of finite element simulation, a prototype of axial flux PMEC is designed, and an experimental platform is built. <xref ref-type="fig" rid="fig-14">Fig. 14</xref> shows the overall structure of the experimental platform. The main equipment includes a base plate, a frequency converter, two AC motors, a PMEC, a torque meter, and a DC motor. The control system mainly includes an industrial personal computer (IPC) for joint operations and monitoring.</p>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Structure of the PMEC experimental platform</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-14.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-15">Fig. 15</xref> shows the actual experimental platform. During the experiment, the air gap length can be adjusted to a maximum of 6 cm to avoid the impact load when starting. Then adjust the air gap to 4 mm for the experiment. Change the load size and record the output torque data of the PMEC.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Physical image of PMEC experimental platform</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-15.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-16">Fig. 16</xref> shows the finite element simulation results and the experimental results. The relative slip is limited to 25 to 75 rpm. The difference between the two is relatively small. Therefore, it can be proven that using finite element simulation to verify the optimization results is reliable.</p>
<fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>Comparison between finite element simulation results and experiments</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_42286-fig-16.tif"/>
</fig>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>This paper proposes a new multi-objective optimization algorithm to optimize the structural parameters of PMEC to improve energy transfer efficiency and reduce loss. The accurate PMEC model is the premise of the follow-up system optimization, control, and other research work. Therefore, the LM optimization algorithm is used to improve the BP neural network, and the nonlinear regression model of PMEC is established. Even when the number of training samples is small, it maintains good generalization ability and high stability. Then, a multi-objective optimization model is established based on the LMBP model of PMEC. For the multi-objective optimization problem, NCMOPSO is proposed and applied to the multi-objective optimization model of PMEC. The final PMEC optimization result improves the system&#x2019;s work efficiency. It lowers energy consumption compared to the prototype by reducing eddy current loss by 1.7824 kW, increasing output torque by 648.2 Nm, and lowering cost by 15.1%. Based on the optimized structural parameters of PMEC, the distribution results of magnetic induction intensity and eddy current density of PMEC before and after optimization are compared through the ANSYS simulation experiment, which verifies that the optimization method is feasible.</p>
</sec>
</body>
<back>
<ack>
<p>None.</p>
</ack>
<sec><title>Funding Statement</title>
<p>This work is supported by the National Natural Science Foundation of China under Grant 52077027.</p>
</sec>
<sec><title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: D. Wang, P. Pan; data collection: D. Wang, B. Niu; analysis and interpretation of results: D. Wang, P. Pan, B. Niu; draft manuscript preparation: D. Wang, P. Pan. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The data used in this paper can be requested from the corresponding author upon request.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. K.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>W. Q.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>M. H.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A simple modelling on transmission torque of eddy-current axial magnetic couplings considering thermal effect</article-title>,&#x201D; <source>IET Electric Power Applications</source>, vol. <volume>16</volume>, no. <issue>4</issue>, pp. <fpage>434</fpage>&#x2013;<lpage>446</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Mohammadi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Mirsalim</surname></string-name></person-group>, &#x201C;<article-title>Design optimization of double-sided permanent-magnet radial-flux eddy-current couplers</article-title>,&#x201D; <source>Electric Power Systems Research</source>, vol. <volume>108</volume>, no. <issue>1</issue>, pp. <fpage>282</fpage>&#x2013;<lpage>292</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Lubin</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Rezzoug</surname></string-name></person-group>, &#x201C;<article-title>Improved 3-D analytical model for axial-flux eddy-current couplings with curvature effects</article-title>,&#x201D; <source>IEEE Transactions on Magnetics</source>, vol. <volume>53</volume>, no. <issue>9</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. H.</given-names> <surname>Shin</surname></string-name>, <string-name><given-names>H. I.</given-names> <surname>Park</surname></string-name>, <string-name><given-names>H. W.</given-names> <surname>Cho</surname></string-name> and <string-name><given-names>J. Y.</given-names> <surname>Choi</surname></string-name></person-group>, &#x201C;<article-title>Semi-three-dimensional analytical torque calculation and experimental testing of an eddy current brake with permanent magnets</article-title>,&#x201D; <source>IEEE Transactions on Applied Superconductivity</source>, vol. <volume>28</volume>, no. <issue>3</issue>, pp. <fpage>5203205</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Dolisy</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mezani</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Lubin</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Leveque</surname></string-name></person-group>, &#x201C;<article-title>A new analytical torque formula for axial field permanent magnets coupling</article-title>,&#x201D; <source>IEEE Transactions on Energy Conversion</source>, vol. <volume>30</volume>, no. <issue>3</issue>, pp. <fpage>892</fpage>&#x2013;<lpage>899</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>A generic 3-D analytical model of permanent magnet eddy-current couplings using a magnetic vector potential formulation</article-title>,&#x201D; <source>IEEE Transactions on Industrial Electronics</source>, vol. <volume>69</volume>, no. <issue>1</issue>, pp. <fpage>663</fpage>&#x2013;<lpage>672</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. K.</given-names> <surname>Razavi</surname></string-name> and <string-name><given-names>M. U.</given-names> <surname>Lamperth</surname></string-name></person-group>, &#x201C;<article-title>Eddy-current coupling with slotted conductor disk</article-title>,&#x201D; <source>IEEE Transactions on Magnetics</source>, vol. <volume>42</volume>, no. <issue>3</issue>, pp. <fpage>405</fpage>&#x2013;<lpage>410</lpage>, <year>2006</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Kong</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Hua</surname></string-name></person-group>, &#x201C;<article-title>Analysis of a novel flux adjustable axial flux permanent magnet eddy current coupler</article-title>,&#x201D; <source>IET Electric Power Applications</source>, vol. <volume>17</volume>, no. <issue>2</issue>, pp. <fpage>181</fpage>&#x2013;<lpage>194</lpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Kong</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Modeling and performance analysis of an axial-radial combined permanent magnet eddy current coupler</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>78367</fpage>&#x2013;<lpage>78377</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Mohammadi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mirsalim</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Vaez-Zadeh</surname></string-name> and <string-name><given-names>H. A.</given-names> <surname>Talebi</surname></string-name></person-group>, &#x201C;<article-title>Analytical modeling and analysis of axial-flux interior permanent-magnet couplers</article-title>,&#x201D; <source>IEEE Transactions on Industrial Electronics</source>, vol. <volume>61</volume>, no. <issue>11</issue>, pp. <fpage>5940</fpage>&#x2013;<lpage>5947</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Equivalent circuit model of eddy current device</article-title>,&#x201D; <source>IEEE Transactions on Magnetics</source>, vol. <volume>54</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. K.</given-names> <surname>Yeo</surname></string-name>, <string-name><given-names>D. K.</given-names> <surname>Lim</surname></string-name> and <string-name><given-names>H. K.</given-names> <surname>Jung</surname></string-name></person-group>, &#x201C;<article-title>Magnetic equivalent circuit model considering the overhang structure of an interior permanent-magnet machine</article-title>,&#x201D; <source>IEEE Transactions on Magnetics</source>, vol. <volume>55</volume>, no. <issue>6</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>D. Y.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Su</surname></string-name></person-group>, &#x201C;<article-title>Modelling and experimental research on the equivalent magnetic circuit network of hybrid magnetic couplers considering the magnetic leakage effect</article-title>,&#x201D; <source>IET Electric Power Applications</source>, vol. <volume>13</volume>, no. <issue>9</issue>, pp. <fpage>1413</fpage>&#x2013;<lpage>1421</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Lubin</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mezani</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Rezzoug</surname></string-name></person-group>, &#x201C;<article-title>Simple analytical expressions for the force and torque of axial magnetic couplings</article-title>,&#x201D; <source>IEEE Transactions on Energy Conversion</source>, vol. <volume>27</volume>, no. <issue>2</issue>, pp. <fpage>536</fpage>&#x2013;<lpage>546</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Zec</surname></string-name>, <string-name><given-names>R. P.</given-names> <surname>Uhlig</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ziolkowski</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Brauer</surname></string-name></person-group>, &#x201C;<article-title>Finite element analysis of nondestructive testing eddy current problems with moving parts</article-title>,&#x201D; <source>IEEE Transactions on Magnetics</source>, vol. <volume>49</volume>, no. <issue>8</issue>, pp. <fpage>4785</fpage>&#x2013;<lpage>4794</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Yu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Electromagnetic-thermal model for improved axial-flux eddy current couplings with combine rectangle-shaped magnets</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, pp. <fpage>26383</fpage>&#x2013;<lpage>26390</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Hogberg</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Mijatovic</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Holboll</surname></string-name>, <string-name><given-names>B. B.</given-names> <surname>Jensen</surname></string-name> and <string-name><given-names>F. B.</given-names> <surname>Bendixen</surname></string-name></person-group>, &#x201C;<article-title>Parametric design optimization of a novel permanent magnet coupling using finite element analysis</article-title>,&#x201D; in <conf-name>IEEE Energy Conversion Congress and Exposition (ECCE)</conf-name>, <publisher-loc>Pittsburgh, PA, USA</publisher-loc>, pp. <fpage>1465</fpage>&#x2013;<lpage>1471</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. N.</given-names> <surname>Patel</surname></string-name> and <string-name><given-names>B. N.</given-names> <surname>Suthar</surname></string-name></person-group>, &#x201C;<article-title>Genetic algorithm-based multi-objective design optimization of radial flux PMBLDC motor</article-title>,&#x201D; in <conf-name>Int. Conf. on Artificial Intelligence and Evolutionary Computations in Engineering Systems (ICAIECES)</conf-name>, <publisher-loc>Madanapalle, India</publisher-loc>, pp. <fpage>551</fpage>&#x2013;<lpage>559</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. H.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>J. Y.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>D. W.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>J. W.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>Y. J.</given-names> <surname>Kim</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Particle swarm optimization algorithm with intelligent particle number control for optimal design of electric machines</article-title>,&#x201D; <source>IEEE Transactions on Industrial Electronics</source>, vol. <volume>65</volume>, no. <issue>2</issue>, pp. <fpage>1791</fpage>&#x2013;<lpage>1798</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. Y.</given-names> <surname>Xing</surname></string-name>, <string-name><given-names>J. L.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>Z. Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Qin</surname></string-name> and <string-name><given-names>L. M.</given-names> <surname>Jia</surname></string-name></person-group>, &#x201C;<article-title>Energy consumption optimization of tramway operation based on improved PSO algorithm</article-title>,&#x201D; <source>Energy</source>, vol. <volume>258</volume>, no. <issue>3</issue>, pp. <fpage>124848</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. Y.</given-names> <surname>Xing</surname></string-name>, <string-name><given-names>Z. Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Qin</surname></string-name> and <string-name><given-names>L. M.</given-names> <surname>Jia</surname></string-name></person-group>, &#x201C;<article-title>Rail train operation energy-saving optimization based on improved brute-force search</article-title>,&#x201D; <source>Applied Energy</source>, vol. <volume>330</volume>, no. <issue>23</issue>, pp. <fpage>120345</fpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Fan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lei</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Multi objective optimization design of unequal Halbach array permanent magnet vernier motor based on optimization algorithm</article-title>,&#x201D; in <conf-name>13th IEEE Energy Conversion Congress and Exposition (IEEE ECCE)</conf-name>, <publisher-loc>Vancouver, BC, Canada</publisher-loc>, pp. <fpage>4220</fpage>&#x2013;<lpage>4225</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Pan</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Niu</surname></string-name></person-group>, &#x201C;<article-title>Design optimization of APMEC using chaos multi-objective particle swarm optimization algorithm</article-title>,&#x201D; <source>Energy Reports</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>531</fpage>&#x2013;<lpage>537</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Ahandani</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Abbasfam</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Kharrati</surname></string-name></person-group>, &#x201C;<article-title>Parameter identification of permanent magnet synchronous motors using quasi-opposition-based particle swarm optimization and hybrid chaotic particle swarm optimization algorithms</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>52</volume>, no. <issue>11</issue>, pp. <fpage>13082</fpage>&#x2013;<lpage>13096</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Lei</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>BP neural network fitting for spectra of blast furnace raceway</article-title>,&#x201D; in <conf-name>Int. Conf. on Recent Trends in Materials and Mechanical Engineering (ICRTMME 2011)</conf-name>, <publisher-loc>Shenzhen, China</publisher-loc>, pp. <fpage>197</fpage>&#x2013;<lpage>202</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wibowo</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Guo</surname></string-name></person-group>, &#x201C;<article-title>Nonlinear curve fitting using extreme learning machines and radial basis function networks</article-title>,&#x201D; <source>Computing in Science &#x0026; Engineering</source>, vol. <volume>21</volume>, no. <issue>5</issue>, pp. <fpage>6</fpage>&#x2013;<lpage>15</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Cheng</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Jin</surname></string-name></person-group>, &#x201C;<article-title>A competitive swarm optimizer for large scale optimization</article-title>,&#x201D; <source>IEEE Transactions on Cybernetics</source>, vol. <volume>45</volume>, no. <issue>2</issue>, pp. <fpage>191</fpage>&#x2013;<lpage>204</lpage>, <year>2015</year>; <pub-id pub-id-type="pmid">24860047</pub-id></mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Deb</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Pratap</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Agarwal</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Meyarivan</surname></string-name></person-group>, &#x201C;<article-title>A fast and elitist multiobjective genetic algorithm: NSGA-II</article-title>,&#x201D; <source>IEEE Transactions on Evolutionary Computation</source>, vol. <volume>6</volume>, no. <issue>2</issue>, pp. <fpage>182</fpage>&#x2013;<lpage>197</lpage>, <year>2002</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. M.</given-names> <surname>May</surname></string-name></person-group>, &#x201C;<article-title>Simple mathematical models with very complicated dynamics</article-title>,&#x201D; <source>Nature</source>, vol. <volume>261</volume>, no. <issue>5560</issue>, pp. <fpage>459</fpage>&#x2013;<lpage>467</lpage>, <year>1976</year>; <pub-id pub-id-type="pmid">934280</pub-id></mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. A. C.</given-names> <surname>Coello</surname></string-name>, <string-name><given-names>G. T.</given-names> <surname>Pulido</surname></string-name> and <string-name><given-names>M. S.</given-names> <surname>Lechuga</surname></string-name></person-group>, &#x201C;<article-title>Handling multiple objectives with particle swarm optimization</article-title>,&#x201D; <source>IEEE Transactions on Evolutionary Computation</source>, vol. <volume>8</volume>, no. <issue>3</issue>, pp. <fpage>256</fpage>&#x2013;<lpage>279</lpage>, <year>2004</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Jin</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Olhofer</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Sendhoff</surname></string-name></person-group>, &#x201C;<article-title>A reference vector guided evolutionary algorithm for many-objective optimization</article-title>,&#x201D; <source>IEEE Transactions on Evolutionary Computation</source>, vol. <volume>20</volume>, no. <issue>5</issue>, pp. <fpage>773</fpage>&#x2013;<lpage>791</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Ge</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Zou</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Fu</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Ge</surname></string-name></person-group>, &#x201C;<article-title>Large-scale multiobjective optimization with adaptive competitive swarm optimizer and inverse modeling</article-title>,&#x201D; <source>Information Sciences</source>, vol. <volume>608</volume>, no. <issue>100791</issue>, pp. <fpage>1441</fpage>&#x2013;<lpage>1463</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Moreira</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Paquete</surname></string-name></person-group>, &#x201C;<article-title>Guiding under uniformity measure in the decision space</article-title>,&#x201D; in <conf-name>IEEE Latin American Conf. on Computational Intelligence (LA-CCI)</conf-name>, <publisher-loc>Guayaquil, Ecuador</publisher-loc>, pp. <fpage>20</fpage>&#x2013;<lpage>25</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>He</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Cheng</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Yazdani</surname></string-name></person-group>, &#x201C;<article-title>Adaptive offspring generation for evolutionary large-scale multiobjective optimization</article-title>,&#x201D; <source>IEEE Transactions on Systems, Man, and Cybernetics: Systems</source>, vol. <volume>52</volume>, no. <issue>2</issue>, pp. <fpage>786</fpage>&#x2013;<lpage>798</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Du</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Ming</surname></string-name></person-group>, &#x201C;<article-title>A novel multi-objective particle swarm optimization with multiple search strategies</article-title>,&#x201D; <source>European Journal of Operational Research</source>, vol. <volume>247</volume>, no. <issue>3</issue>, pp. <fpage>732</fpage>&#x2013;<lpage>744</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. J.</given-names> <surname>Nebro</surname></string-name>, <string-name><given-names>J. J.</given-names> <surname>Durillo</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Garcia-Nieto</surname></string-name>, <string-name><given-names>C. A.</given-names> <surname>Coello</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Alba</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>SMPSO: A new PSO-based metaheuristic for multi-objective optimization</article-title>,&#x201D; in <conf-name>IEEE Symp. on Computational Intelligence in Multi-Criteria Decision-Making</conf-name>, <publisher-loc>Nashville, TN, USA</publisher-loc>, pp. <fpage>66</fpage>&#x2013;<lpage>73</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ye</surname></string-name></person-group>, &#x201C;<article-title>A new multi-objective particle swarm optimization algorithm based on decomposition</article-title>,&#x201D; <source>Information Sciences</source>, vol. <volume>325</volume>, no. <issue>9</issue>, pp. <fpage>541</fpage>&#x2013;<lpage>557</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C. A. C.</given-names> <surname>Coello</surname></string-name> and <string-name><given-names>M. S.</given-names> <surname>Lechuga</surname></string-name></person-group>, &#x201C;<article-title>MOPSO: A proposal for multiple objective particle swarm optimization</article-title>,&#x201D; in <conf-name>IEEE World Congress on Computational Intelligence (WCCI2002)</conf-name>, <publisher-loc>Honolulu, HNL, USA</publisher-loc>, pp. <fpage>1051</fpage>&#x2013;<lpage>1056</lpage>, <year>2002</year>.</mixed-citation></ref>
</ref-list>
</back></article>