Pareto-optimal parametric synthesis of axisymmetric magnetic systems with allowance for nonlinear properties of the ferromagnet

被引:16
作者
Gal'chenko, V. Ya. [1 ]
Yakimov, A. N. [1 ]
Ostapushchenko, D. L. [1 ]
机构
[1] Lugansk State Med Univ, UA-91045 Lugansk, Ukraine
关键词
ALGORITHM; DESIGN;
D O I
10.1134/S1063784212070110
中图分类号
O59 [应用物理学];
学科分类号
摘要
A method of Pareto-optimal synthesis is worked out for axisymmetric magnetic systems containing ferromagnetic elements with nonlinear magnetic properties. The method is based on the simultaneous application of the swarm intelligence paradigm and the evolution optimization with the help of genetic algorithms. Numerical examples of designing the devices for producing uniform and gradient magnetic fields in their working volume are considered.
引用
收藏
页码:893 / 899
页数:7
相关论文
共 14 条
[1]  
[Anonymous], 2009, NONITERATIVE EVOLUTI
[2]   Pareto optimality and particle swarm optimization [J].
Baumgartner, U ;
Magele, C ;
Renhart, W .
IEEE TRANSACTIONS ON MAGNETICS, 2004, 40 (02) :1172-1175
[3]  
Clerc M., 2006, Particle Swarm Optimization
[4]  
Galchenko V. Y., 2010, Information Technologies, P9
[5]  
[Гальченко Владимир Яковлевич Galchenko V.Ya.], 2011, [Дефектоскопия, Russian Journal of Nondestructive Testing, Defektoskopiya], P3
[6]   A simulated annealing algorithm for multiobjective optimizations of electromagnetic devices [J].
Ho, SL ;
Yang, SY ;
Wong, HC ;
Ni, GZ .
IEEE TRANSACTIONS ON MAGNETICS, 2003, 39 (03) :1285-1288
[7]   A tabu method to find the Pareto solutions of multiobjective optimal design problems in electromagnetics [J].
Ho, SL ;
Yang, SY ;
Ni, GZ ;
Wong, HC .
IEEE TRANSACTIONS ON MAGNETICS, 2002, 38 (02) :1013-1016
[8]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[9]  
KURBATOV PA, 2007, ELECTR TECHNOL RUSS+, P47
[10]   Improved GA and PSO culled hybrid algorithm for antenna array pattern synthesis [J].
Li, W. T. ;
Shi, X. W. ;
Xu, L. ;
Hei, Y. Q. .
PROGRESS IN ELECTROMAGNETICS RESEARCH-PIER, 2008, 80 :461-476