Multi-Objective Optimal Design of Bearingless Switched Reluctance Motor Based on Multi-Objective Genetic Particle Swarm Optimizer

被引:8
作者
Zhang, Jingwei [1 ]
Wang, Honghua [1 ]
Chen, Ling [1 ]
Tan, Chao [1 ]
Wang, Yi [1 ]
机构
[1] Hohai Univ, Coll Energy & Elect Engn, Nanjing 211100, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Bearingless switched reluctance motor (BSRM); multi-objective optimization; optimal design; particle swarm optimizer; RADIAL FORCE; TORQUE; ALGORITHM; LOSSES;
D O I
10.1109/TMAG.2017.2751546
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In recent decades, bearingless switched reluctance motors (BSRMs) have been proposed. However, few researchers focused on the optimal design of the BSRMs. In this paper, the multi-objective optimal design of BSRMs is investigated. At first, an analytical design model is derived from the mathematical model of the BSRMs. An initial design is calculated by the analytical design model. The electromagnetic performance is compared with calculation results from the finite-element method (FEM). Then, the objective functions, constraints, and decision variables are also determined. Corresponding sensitivity analysis of the decision variables is implemented. Besides, aiming at solving the optimization problem with disconnected, non-uniformly distributed Pareto front and multiple local optimums, a novel multi-objective genetic particle swarm optimizer (MOGPSO) is presented. The algorithm performance of the proposed MOGPSO is validated by solving the standard test functions. Then the proposed MOGPSO is applied for the optimal design of BSRMs. Optimization results solved by MOGPSO, conventional multi-objective particle swarm optimizer, and non-dominated sorting genetic algorithm II are compared and analyzed. Comparison results reveal that the proposed MOGPSO can achieve more non-dominated solutions in Pareto front and is particularly suitable for optimization of BSRMs. The final optimal design is selected from the obtained Pareto front. The electromagnetic performance is compared with the initial design and verified by the FEM. Verification results show that the optimal design of BSRMs based on the analytical design model and the proposed MOGPSO is feasible and effective.
引用
收藏
页数:13
相关论文
共 29 条
[1]  
[Anonymous], 2006, Int J Comput Intell Res, DOI DOI 10.5019/J.IJCIR.2006.68
[2]   Adaptive Parameter Controlling Non-Dominated Ranking Differential Evolution for Multi-Objective Optimization of Electromagnetic Problems [J].
Baatar, Nyambayar ;
Jeong, Kwang-Young ;
Koh, Chang-Seop .
IEEE TRANSACTIONS ON MAGNETICS, 2014, 50 (02) :709-712
[3]  
Barba P. D., 2010, MULTIOBJECTIVE SHAPE, V47
[4]   The Wind Driven Optimization Technique and its Application in Electromagnetics [J].
Bayraktar, Zikri ;
Komurcu, Muge ;
Bossard, Jeremy A. ;
Werner, Douglas H. .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2013, 61 (05) :2745-2757
[5]   A General Model to Predict the Iron Losses in PWM Inverter-Fed Induction Motors [J].
Boglietti, Aldo ;
Cavagnino, Andrea ;
Ionel, Dan M. ;
Popescu, Mircea ;
Staton, David A. ;
Vaschetto, Silvio .
IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS, 2010, 46 (05) :1882-1890
[6]   Independent Control of Average Torque and Radial Force in Bearingless Switched-Reluctance Motors With Hybrid Excitations [J].
Cao, Xin ;
Deng, Zhiquan ;
Yang, Gang ;
Wang, Xiaolin .
IEEE TRANSACTIONS ON POWER ELECTRONICS, 2009, 24 (5-6) :1376-1385
[7]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   Multi-objective wind-driven optimisation and magnet design [J].
Di Barba, P. .
ELECTRONICS LETTERS, 2016, 52 (14) :1216-1217
[10]   A Hybridized Vector Optimal Algorithm for Multi-Objective Optimal Designs of Electromagnetic Devices [J].
Hu, Guanzhong ;
Yang, Shiyou ;
Li, Yuling ;
Khan, Shafi Ullah .
IEEE TRANSACTIONS ON MAGNETICS, 2016, 52 (03)