2012
DOI: 10.1016/j.asoc.2011.10.013
|View full text |Cite
|
Sign up to set email alerts
|

Evolution strategies and multi-objective optimization of permanent magnet motor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0
1

Year Published

2012
2012
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 13 publications
0
6
0
1
Order By: Relevance
“…Most of the metaheuristic techniques can be used to solve global optimization problems with nonlinear constraint by using metaheuristic algorithms; there is a high possibility to determine a near optimal solution, which can be considered by designer and engineering as a global optimum [22].…”
Section: Optimization and Control Of Electrical Machinesmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of the metaheuristic techniques can be used to solve global optimization problems with nonlinear constraint by using metaheuristic algorithms; there is a high possibility to determine a near optimal solution, which can be considered by designer and engineering as a global optimum [22].…”
Section: Optimization and Control Of Electrical Machinesmentioning
confidence: 99%
“…One of the most promising algorithms from the class of evolutionary algorithms widely used in the field of electric machines is Differential Evolution (DE) [22][23][24] first introduced by Price and Storn [25] in 1995. The algorithm was later improved and named Generalized Differential Evolution (GDE) (extended DE for constrained multi-objective optimization) by Lampinen…”
Section: Optimization and Control Of Electrical Machinesmentioning
confidence: 99%
“…ГА не требуют заданной отправной точки, позволяет использовать нелинейные, дискретные целевые функции и условия ограничения. Хотя он не строго математически гарантирует, что оптимальные решения будут найдены, но существует высокая вероятность того, что близкое к оптимальному решение будет найдено [7]. Множество этих решений находится очень близко к настоящему Парето-фронту и называется аппроксимацией множества Парето.…”
Section: постановка задачи оптимизации параметров и выбор метода оптиunclassified
“…With restrictions that vary and some objective functions in solving optimization problems become the distinct advantage for evolutionary algorithms (Datta and Regis, 2016, Yoosefelahi et al, 2012, Andersen and Santos, 2012. As one of the evolutionary algorithms that implement processes of recombination and mutation, evolution strategies have proven to provide quality solutions to the optimization problem refers to several studies that already exist (Munawaroh and Mahmudy, 2015, Milah and Mahmudy, 2015, Vista and Mahmudy, 2015.…”
Section: Introductionmentioning
confidence: 99%