Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download file Download BibTeX

Title

Performance analysis of selected metaheuristic optimization algorithms applied in the solution of an unconstrained task

Authors

[ 1 ] Instytut Elektrotechniki i Elektroniki Przemysłowej, Wydział Automatyki, Robotyki i Elektrotechniki, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.2] Automation, electronics, electrical engineering and space technology

Year of publication

2022

Published in

COMPEL - The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

Journal year: 2022 | Journal volume: vol. 41 | Journal number: iss. 5

Article type

scientific article

Publication language

english

Keywords
EN
  • Electrical machine
  • Optimal design
  • Permanent magnet machine
  • Finite element method
  • Multi-objective optimization
  • Optimization
  • Metaheuristic algorithm
  • Unconstrained problems
  • Line-start permanent magnet synchronous motor
Abstract

EN Purpose – The purpose of this paper is to execute the efficiency analysis of the selected metaheuristic algorithms (MAs) based on the investigation of analytical functions and investigation optimization processes for permanent magnet motor. Design/methodology/approach – A comparative performance analysis was conducted for selected MAs. Optimization calculations were performed for as follows: genetic algorithm (GA), particle swarm optimization algorithm (PSO), bat algorithm, cuckoo search algorithm (CS) and only best individual algorithm (OBI). All of the optimization algorithms were developed as computer scripts. Next, all optimization procedures were applied to search the optimal of the line-start permanent magnet synchronous by the use of the multi-objective objective function. Findings – The research results show, that the best statistical efficiency (mean objective function and standard deviation [SD]) is obtained for PSO and CS algorithms. While the best results for several runs are obtained for PSO and GA. The type of the optimization algorithm should be selected taking into account the duration of the single optimization process. In the case of time-consuming processes, algorithms with low SD should be used. Originality/value – The new proposed simple nondeterministic algorithm can be also applied for simple optimization calculations. On the basis of the presented simulation results, it is possible to determine the quality of the compared MAs.

Pages (from - to)

1271 - 1284

DOI

10.1108/COMPEL-07-2021-0254

URL

https://www.emerald.com/insight/content/doi/10.1108/COMPEL-07-2021-0254/full/html

License type

CC BY (attribution alone)

Open Access Mode

publisher's website

Open Access Text Version

final author's version

Date of Open Access to the publication

at the time of publication

Full text of article

Download file

Access level to full text

public

Ministry points / journal

40

Impact Factor

0,7

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.