LATIN-AMERICAN JOURNAL OF COMPUTING (LAJC), Vol XI, Issue 1, January - June 2024
Single-Phase Variable Reluctance Motor Design
using Particle Swarm Optimization
Danyelle Schumanski
Federal University of Paraná
Electrical Engineering Post-
Graduation Program
Curitiba-PR, Brazil
schumanski@ufpr.br
Dullian Carly de Oliveira Macedo
Federal University of Paraná
Civil Engineering Undergraduate
Pontal do Paraná-PR, Brazil
dullianmacedo@ufpr.br
Cinthia Schimith Silva Coelho
Pontifical Catholic University of
Paraná
Electrical Engineering Department
Curitiba-PR, Brazil
cinthia.coelho@pucpr.br
Juliana Almansa Malagoli
Federal University of Paraná
Electrical Engineering Post-
Graduation Program
Curitiba-PR, Brazil
juliana.malagoli@ufpr.br
Abstract— Electrical engines are built under electromagnetism
concepts to create mechanical power, those can be seen as simple
machines, as it depends on reluctance, even being called as
“reluctance motor”, what gives this engine the possibility of being
widely used for many purposes. The main objective of this research
is to minimize copper losses of a single-phase 6x6 variable
reluctance synchronous motor. For that, a Particle Swarm
Optimization (PSO) algorithm will be used to obtain the optimum
configuration through the Finite Elements Method (FEM). In this
context, electric motor design equations were dimensioned based on
similar machines. The next procedure was to use FEMM (Finite
Element Method Magnetics) software, that allows the magnetic flow
density analysis inside the motor air gap. Finally, it is noteworthy
that the copper losses results were analyzed before and after the
variable reluctance motor optimization with computational tools.
Keywords—single-phase reluctance motor, finite element
method, particle swarm optimization
I. I
NTRODUCTION
Variable reluctance synchronous motors (VRSMs) are
common engines with simple building aspects low
computational and financial costs, but with a wide range of
applications. These are the main reasons why reference [1]
considered these motors competitive. The VRSMs dual
capacity of acting like a motor and a generator, which avoids
high inrush currents, reduce costs and operates under constant
rotation, that are aspects of engines without windings and
magnets and with a single source of incitation applied to the
stator windings, what intends to minimize all the resistive
losses of machinery winding that occur in the stator current
flow.
Therefore, it is possible to estimate an optimal motor,
based on specifications of power and size of a previous model
[2]. In this context, the research objective is to minimize the
copper losses, of a variable reluctance motor (VRM), by using
the particle swarm method (PSO algorithm). This way,
dimension parameters were used to design the original motor
and the optimum motor was designed after applying the finite
elements method. Finally, after the optimization process,
copper losses and magnetic flow densities were evaluated and
the results of both original and optimum motors were
compared
II. L
ITERATURE
R
EVIEW
This section will be divided in three parts: Particle Swarm
Optimization, Finite Elements Method and Variable
Reluctance Motor Design.
A. Swarm Particle Optimization
The PSO algorithm is a computational method that aims to
optimize a problem through a proceeding that generates a
sequence of approximate solutions that at each interaction,
tend to converge to an optimum solution [3]. Comparative
studies about the PSO (Particle Swarm Optimization) aspects
were inspired on animal behavior, where each individual, of
an equally dispersed population inside the problem area,
efficiencies were compared. At each executed interaction, the
individuals tend to group in smaller spaces around the best
solution, therefore, an inertia constant can be estimated, based
on the group tendency to find the best solution and considering
each individual's best solution.
After a sequence of interactions performed by each
individual, the optimum solution for the problem is found [4].
Next the algorithm implementation steps:
• Initially, each swarm particle has a position
inside
the search space and the speed
, where the positions
are automatically generated;
• For each swarm particle executed interaction, the
particle position and the group position
are updated, in case they are better than the previous.
During the interaction, the speeds and positions of each swarm
particle are updated by the Equations 1 and 2, respectively, to
obtain the new position:
;
(
+ 1
)
+ ωv
+
1
1
(
−
)
+. . .
. . . +
2
2
(
−
)
(1)
(
+ 1
)
=
+
(
+ 1
)
(2)
where
(
+ 1
)
is the updated term for particle speed,
+ 1 is the actual instant, is the previous instant, ω is the
algorithm inertia constant,
1
is the individual acceleration
coefficient responsible for controlling the particle movement
distance in one interaction,
2
is the group acceleration