Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    An Improved Bald Eagle Search Algorithm with Cauchy Mutation and Adaptive Weight Factor for Engineering Optimization

    Wenchuan Wang1,*, Weican Tian1, Kwok-wing Chau2, Yiming Xue1, Lei Xu3, Hongfei Zang1

    CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.2, pp. 1603-1642, 2023, DOI:10.32604/cmes.2023.026231 - 06 February 2023

    Abstract The Bald Eagle Search algorithm (BES) is an emerging meta-heuristic algorithm. The algorithm simulates the hunting behavior of eagles, and obtains an optimal solution through three stages, namely selection stage, search stage and swooping stage. However, BES tends to drop-in local optimization and the maximum value of search space needs to be improved. To fill this research gap, we propose an improved bald eagle algorithm (CABES) that integrates Cauchy mutation and adaptive optimization to improve the performance of BES from local optima. Firstly, CABES introduces the Cauchy mutation strategy to adjust the step size of… More >

  • Open Access

    ARTICLE

    Feasibility-Guided Constraint-Handling Techniques for Engineering Optimization Problems

    Muhammad Asif Jan1,*, Yasir Mahmood1, Hidayat Ullah Khan2, Wali Khan Mashwani1, Muhammad Irfan Uddin3, Marwan Mahmoud4, Rashida Adeeb Khanum5, Ikramullah6, Noor Mast3

    CMC-Computers, Materials & Continua, Vol.67, No.3, pp. 2845-2862, 2021, DOI:10.32604/cmc.2021.015294 - 01 March 2021

    Abstract The particle swarm optimization (PSO) algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and fish. PSO is essentially an unconstrained algorithm and requires constraint handling techniques (CHTs) to solve constrained optimization problems (COPs). For this purpose, we integrate two CHTs, the superiority of feasibility (SF) and the violation constraint-handling (VCH), with a PSO. These CHTs distinguish feasible solutions from infeasible ones. Moreover, in SF, the selection of infeasible solutions is based on their degree of constraint violations, whereas in VCH, the number of constraint violations by an infeasible solution… More >

Displaying 1-10 on page 1 of 2. Per Page