An improved gravitational search algorithm for solving an electromagnetic design problem

被引:0
|
作者
Talha Ali Khan
Sai Ho Ling
机构
[1] University of Technology Sydney,
来源
关键词
Gravitational search algorithm; Magnetic fields; Loney’s solenoid problem; Optimization;
D O I
暂无
中图分类号
学科分类号
摘要
The gravitational search algorithm (GSA) is a novel optimization technique that relies upon the law of motion and law of gravity of masses to describe the interaction between the agents. The GSA has shown outstanding performance but suffers from the drawback of a slow process due to the dependence of the fitness function on the masses of the agents. As a result, after each iteration, the masses get heavier, restricting their movement. Due to this effect, the masses cancel out the gravitational forces on each other, preventing them from finding the optimum quickly. To overcome this limitation, an improved GSA based on a modified exploitation strategy is proposed herein. The primary aim of this modification is to enhance the performance of the algorithm in terms of faster convergence and avoidance of premature convergence. An electromagnetic optimization problem is used to validate the performance of the presented method. The simulation results confirm that the proposed method provides outstanding results in solving Loney’s solenoid design problem and that the stability of the solution is much better compared with those obtained using the standard gravitational search algorithm or various other state-of-the-art techniques that have previously been applied to solve this problem.
引用
收藏
页码:773 / 779
页数:6
相关论文
共 50 条
  • [41] Improved Gravitational Search Algorithm Based on Adaptive Strategies
    Yang, Zhonghua
    Cai, Yuanli
    Li, Ge
    [J]. ENTROPY, 2022, 24 (12)
  • [42] Improved gravitational search algorithm based on free search differential evolution
    Yong Liu
    Liang Ma
    [J]. Journal of Systems Engineering and Electronics, 2013, 24 (04) : 690 - 698
  • [43] A modified gravitational search algorithm for discrete optimization problem
    Sudin, Shahdan
    Nawawi, Sophan Wahyudi
    Zainal Abidin, Amar Faiz
    Abdul Rahim, Muhammad Arif
    Khalil, Kamal
    Ibrahim, Zuwairie
    Md Yusof, Zulkifli
    [J]. International Journal of Simulation: Systems, Science and Technology, 2014, 15 (01): : 51 - 55
  • [44] An Improved Immune Algorithm for Solving TSP Problem
    Xue, Hongquan
    Wei, Shengmin
    Yang, Lin
    [J]. AUTOMATION EQUIPMENT AND SYSTEMS, PTS 1-4, 2012, 468-471 : 678 - +
  • [45] Solving TSP Problem with Improved Genetic Algorithm
    Fu, Chunhua
    Zhang, Lijun
    Wang, Xiaojing
    Qiao, Liying
    [J]. 6TH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN, MANUFACTURING, MODELING AND SIMULATION (CDMMS 2018), 2018, 1967
  • [46] An improved genetic algorithm for solving packing problem
    Li Zhi-yan
    [J]. PROCEEDINGS OF THE 2016 4TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY, 2016, 60 : 1816 - 1821
  • [47] An improved algorithm for solving the Weber location problem
    Drezner, Zvi
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2024,
  • [48] A heuristic aided Stochastic Beam Search algorithm for solving the transit network design problem
    Islam, Kazi Ashik
    Moosa, Ibraheem Muhammad
    Mobin, Jaiaid
    Nayeem, Muhammad Ali
    Rahman, M. Sohel
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2019, 46 : 154 - 170
  • [49] Solving Sequence-dependent Disassembly Line Balancing Problem with Improved Cuckoo Search Algorithm
    Zhou, Ronghe
    Guo, XiWang
    Fu, Yaping
    Qi, Liang
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), 2019, : 403 - 408
  • [50] Solving optimal reactive power control problem using a novel Improved Cuckoo Search Algorithm
    Chen, Gonggui
    Lu, Zhengqin
    Zhang, Zhizhong
    [J]. 2018 CHINESE AUTOMATION CONGRESS (CAC), 2018, : 1252 - 1257