Chaotic Multi-swarm Particle Swarm Optimization for Welded Beam Design Engineering Problem

被引:0
|
作者
Feneaker, Shahad Odah Feneaker [1 ]
Akyol, Kemal [2 ]
机构
[1] Sunni Vakif Divani, Irak Basbakanligi, Bagdat, Iraq
[2] Kastamonu Univ, Muhendislik & Mimarlik Fak Bilgisayar Muhendisligi, Kastamonu, Turkey
来源
关键词
Welded beam design; optimization; chaotic multi-swarm particle swarm optimization; STRATEGIES;
D O I
10.2339/politeknik.880994
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Design optimization is an important engineering design activity. In general, design optimization determines the necessary values for the design variables so as to optimize the objective function under certain constraints. Particle swarm optimization algorithm experiences unbalanced between local search and global search. Meeting room approach was introduced as a multi-swarm model to improve the Particle Swarm Optimization algorithm. However, Multiple Swarm Particle Swarm Optimization algorithm may not start with a good position. Therefore, the algorithm may have a slow convergence. This problem can be overcome by using a position created with a chaotic logistics map. Welded Beam Design, which is an engineering problem, mainly aims to minimize the beam cost due to constraints on loading load, shear stress, bending stress and final deflection. The aim of this study is to evaluate the performance of the Chaotic Multiple-swarm Particle Swarm Optimization algorithm in solving this problem. In this context, experimental studies were carried out with different swarm sizes and iteration numbers. According to the results obtained, the Chaotic Multi-swarm Particle Swarm Optimization algorithm offers a good solution compared to other well-known algorithms.
引用
收藏
页码:1645 / 1660
页数:18
相关论文
共 50 条
  • [1] Multi-swarm chaotic particle swarm optimization for protein folding
    Zheng, Hui
    Jie, Jing
    Zheng, Yongping
    Journal of Bionanoscience, 2013, 7 (06): : 643 - 648
  • [2] Chaotic Multi-swarm Particle Swarm Optimization Using Combined Quartic Functions
    Tatsumi, Keiji
    Ibuki, Takeru
    Tanino, Tetsuzo
    2015 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2015): BIG DATA ANALYTICS FOR HUMAN-CENTRIC SYSTEMS, 2015, : 2096 - 2101
  • [3] A Multi-Swarm Cooperative Perturbed Particle Swarm Optimization
    Yang, Xiangjun
    Zhao, Yilong
    Chen, Yuchuang
    Zhao, Xinchao
    ADVANCED RESEARCH ON AUTOMATION, COMMUNICATION, ARCHITECTONICS AND MATERIALS, PTS 1 AND 2, 2011, 225-226 (1-2): : 619 - 622
  • [4] Fully Learned Multi-swarm Particle Swarm Optimization
    Niu, Ben
    Huang, Huali
    Ye, Bin
    Tan, Lijing
    Liang, Jane Jing
    ADVANCES IN SWARM INTELLIGENCE, PT1, 2014, 8794 : 150 - 157
  • [5] Dynamic Multi-swarm Global Particle Swarm Optimization
    Tang, Yichao
    Li, Xiong
    Zhang, Yinglong
    Xia, Xuewen
    Gui, Ling
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1030 - 1037
  • [6] Multi-swarm Particle Swarm Optimization for Payment Scheduling
    Li, Xiao-Miao
    Lin, Ying
    Chen, Wei-Neng
    Zhang, Jun
    2017 SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST2017), 2017, : 284 - 291
  • [7] Dynamic multi-swarm global particle swarm optimization
    Xia, Xuewen
    Tang, Yichao
    Wei, Bo
    Zhang, Yinglong
    Gui, Ling
    Li, Xiong
    COMPUTING, 2020, 102 (07) : 1587 - 1626
  • [8] Dynamic multi-swarm global particle swarm optimization
    Xuewen Xia
    Yichao Tang
    Bo Wei
    Yinglong Zhang
    Ling Gui
    Xiong Li
    Computing, 2020, 102 : 1587 - 1626
  • [9] Pressure Vessel Design Simulation: Implementing of Multi-Swarm Particle Swarm Optimization
    Salih, Sinan Q.
    Alsewari, AbdulRahman A.
    Yaseen, Zaher M.
    2019 8TH INTERNATIONAL CONFERENCE ON SOFTWARE AND COMPUTER APPLICATIONS (ICSCA 2019), 2019, : 120 - 124
  • [10] A dynamic multi-swarm cooperation particle swarm optimization with dimension mutation for complex optimization problem
    Xu Yang
    Hongru Li
    Xia Yu
    International Journal of Machine Learning and Cybernetics, 2022, 13 : 2581 - 2608