A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices
The memetic algorithms which employ population information spreading mechanism have shown great potentials in solving complex three-dimensional black-box problems. In this paper, a newly developed memetic meta-heuristic optimization method, known as shuffled frog leaping algorithm (SFLA), is modifie...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-09-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/10/18/6186 |
id |
doaj-a6b1e83eeeda49f686c3c8e49c985342 |
---|---|
record_format |
Article |
spelling |
doaj-a6b1e83eeeda49f686c3c8e49c9853422020-11-25T01:56:48ZengMDPI AGApplied Sciences2076-34172020-09-01106186618610.3390/app10186186A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet DevicesWenjia Yang0Siu Lau Ho1Weinong Fu2Department of Electrical Engineering, The Hong Kong Polytechnic University; Hong Kong SAR, ChinaDepartment of Electrical Engineering, The Hong Kong Polytechnic University; Hong Kong SAR, ChinaDepartment of Electrical Engineering, The Hong Kong Polytechnic University; Hong Kong SAR, ChinaThe memetic algorithms which employ population information spreading mechanism have shown great potentials in solving complex three-dimensional black-box problems. In this paper, a newly developed memetic meta-heuristic optimization method, known as shuffled frog leaping algorithm (SFLA), is modified and applied to topology optimization of electromagnetic problems. Compared to the conventional SFLA, the proposed algorithm has an extra local search step, which allows it to escape from the local optimum, and hence avoid the problem of premature convergence to continue its search for more accurate results. To validate the performance of the proposed method, it was applied to solving the topology optimization of an interior permanent magnet motor. Two other EAs, namely the conventional SFLA and local-search genetic algorithm, were applied to study the same problem and their performances were compared with that of the proposed algorithm. The results indicate that the proposed algorithm has the best trade-off between the results of objective values and optimization time, and hence is more efficient in topology optimization of electromagnetic devices.https://www.mdpi.com/2076-3417/10/18/6186topology optimizationnumerical methodevolutionary algorithmshuffled frog leaping algorithm |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wenjia Yang Siu Lau Ho Weinong Fu |
spellingShingle |
Wenjia Yang Siu Lau Ho Weinong Fu A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices Applied Sciences topology optimization numerical method evolutionary algorithm shuffled frog leaping algorithm |
author_facet |
Wenjia Yang Siu Lau Ho Weinong Fu |
author_sort |
Wenjia Yang |
title |
A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices |
title_short |
A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices |
title_full |
A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices |
title_fullStr |
A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices |
title_full_unstemmed |
A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices |
title_sort |
modified shuffled frog leaping algorithm for the topology optimization of electromagnet devices |
publisher |
MDPI AG |
series |
Applied Sciences |
issn |
2076-3417 |
publishDate |
2020-09-01 |
description |
The memetic algorithms which employ population information spreading mechanism have shown great potentials in solving complex three-dimensional black-box problems. In this paper, a newly developed memetic meta-heuristic optimization method, known as shuffled frog leaping algorithm (SFLA), is modified and applied to topology optimization of electromagnetic problems. Compared to the conventional SFLA, the proposed algorithm has an extra local search step, which allows it to escape from the local optimum, and hence avoid the problem of premature convergence to continue its search for more accurate results. To validate the performance of the proposed method, it was applied to solving the topology optimization of an interior permanent magnet motor. Two other EAs, namely the conventional SFLA and local-search genetic algorithm, were applied to study the same problem and their performances were compared with that of the proposed algorithm. The results indicate that the proposed algorithm has the best trade-off between the results of objective values and optimization time, and hence is more efficient in topology optimization of electromagnetic devices. |
topic |
topology optimization numerical method evolutionary algorithm shuffled frog leaping algorithm |
url |
https://www.mdpi.com/2076-3417/10/18/6186 |
work_keys_str_mv |
AT wenjiayang amodifiedshuffledfrogleapingalgorithmforthetopologyoptimizationofelectromagnetdevices AT siulauho amodifiedshuffledfrogleapingalgorithmforthetopologyoptimizationofelectromagnetdevices AT weinongfu amodifiedshuffledfrogleapingalgorithmforthetopologyoptimizationofelectromagnetdevices AT wenjiayang modifiedshuffledfrogleapingalgorithmforthetopologyoptimizationofelectromagnetdevices AT siulauho modifiedshuffledfrogleapingalgorithmforthetopologyoptimizationofelectromagnetdevices AT weinongfu modifiedshuffledfrogleapingalgorithmforthetopologyoptimizationofelectromagnetdevices |
_version_ |
1724977522546835456 |