Enhanced crow search algorithm for optimum design of structures

被引:49
|
作者
Javidi, Armin [1 ]
Salajegheh, Eysa [1 ]
Salajegheh, Javad [1 ]
机构
[1] Shahid Bahonar Univ Kerman, Dept Civil Engn, Kerman, Iran
关键词
Metaheuristic algorithm; Free-fly mechanism; Active constraints; Size optimization; PARTICLE SWARM OPTIMIZER; TRUSS STRUCTURES; EVOLUTIONARY ALGORITHMS; SIZING OPTIMIZATION; STRATEGY;
D O I
10.1016/j.asoc.2019.01.026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this study, the capability of recently introduced crow search algorithm (CSA) was evaluated for structural optimization problems. It is observed that the standard CSA was led to undesirable performance for solving structural optimization problems. Accordingly, three modifications were made on the standard CSA to obtain the enhanced crow search algorithm (ECSA) while no parameter was added to the ECSA. First, each violated decision variable was replaced by corresponding decision variable of the global best solution. Second, a free-fly mechanism was suggested for constraint handling. Third, the personal upper bound strategy (PUBS) was proposed for elimination of inessential structural analyses. To assess the efficacy of the proposed modifications, four popular benchmark structures were employed and each modification was added to the CSA in a separate stage and then its effects were illustrated. The results of benchmark structures were examined in terms of minimum weight, convergence rate, and reliability. The results confirmed that the ECSA was significantly better than the standard CSA. Moreover, the ECSA obtained better or very competitive results in comparison with well-known and other newly developed metaheuristic methods. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:274 / 289
页数:16
相关论文
共 50 条
  • [31] Optimal Solution of Structural Engineering Design Problems using Crow Search Algorithm
    Agarwal, Madhur
    INTERNATIONAL JOURNAL OF MATHEMATICAL ENGINEERING AND MANAGEMENT SCIENCES, 2019, 4 (04) : 968 - 981
  • [32] Evolution of conformal antenna design with the aid of probability improved crow search algorithm
    Nagendra, Nama Ajay
    Pappula, Lakshman
    DATA TECHNOLOGIES AND APPLICATIONS, 2021, 55 (03) : 353 - 371
  • [33] Model parameters identification of the PEMFCs using an improved design of Crow Search Algorithm
    Duan, Fude
    Song, Fei
    Chen, Sainan
    Khayatnezhad, Majid
    Ghadimi, Noradin
    INTERNATIONAL JOURNAL OF HYDROGEN ENERGY, 2022, 47 (79) : 33839 - 33849
  • [34] Optimum design of steel frames using harmony search algorithm
    S. O. Degertekin
    Structural and Multidisciplinary Optimization, 2008, 36 : 393 - 401
  • [35] OPTIMUM DESIGN OF INDUSTRIAL PRECAST BUILDINGS BY HARMONY SEARCH ALGORITHM
    Palanci, Mehmet
    PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, 2014, 20 (03): : 85 - 91
  • [36] Optimum design of steel frames using harmony search algorithm
    Degertekin, S. O.
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2008, 36 (04) : 393 - 401
  • [37] Efficient gravitational search algorithm for optimum design of retaining walls
    Khajehzadeh, Mohammad
    Taha, Mohd Raihan
    Eslami, Mahdiyeh
    STRUCTURAL ENGINEERING AND MECHANICS, 2013, 45 (01) : 111 - 127
  • [38] A diversity enhanced hybrid particle swarm optimization and crow search algorithm for feature selection
    Osei-kwakye, Jeremiah
    Han, Fei
    Amponsah, Alfred Adutwum
    Ling, Qing-Hua
    Abeo, Timothy Apasiba
    APPLIED INTELLIGENCE, 2023, 53 (17) : 20535 - 20560
  • [39] A diversity enhanced hybrid particle swarm optimization and crow search algorithm for feature selection
    Jeremiah Osei-kwakye
    Fei Han
    Alfred Adutwum Amponsah
    Qing-Hua Ling
    Timothy Apasiba Abeo
    Applied Intelligence, 2023, 53 : 20535 - 20560
  • [40] Optimum Median Filter Based on Crow Optimization Algorithm
    Saleh, Basma Jumaa
    Saedi, Ahmed Yousif Falih
    Salman, Lamees Abdalhasan
    al-Aqbi, Ali Talib Qasim
    BAGHDAD SCIENCE JOURNAL, 2021, 18 (03) : 614 - 627