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 Artificial Rabbits Optimization Algorithm with Chaotic Local Search and Opposition-Based Learning for Engineering Problems and Its Applications in Breast Cancer Problem

    Feyza Altunbey Özbay1, Erdal Özbay2, Farhad Soleimanian Gharehchopogh3,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.141, No.2, pp. 1067-1110, 2024, DOI:10.32604/cmes.2024.054334 - 27 September 2024

    Abstract Artificial rabbits optimization (ARO) is a recently proposed biology-based optimization algorithm inspired by the detour foraging and random hiding behavior of rabbits in nature. However, for solving optimization problems, the ARO algorithm shows slow convergence speed and can fall into local minima. To overcome these drawbacks, this paper proposes chaotic opposition-based learning ARO (COARO), an improved version of the ARO algorithm that incorporates opposition-based learning (OBL) and chaotic local search (CLS) techniques. By adding OBL to ARO, the convergence speed of the algorithm increases and it explores the search space better. Chaotic maps in CLS… More > Graphic Abstract

    An Improved Artificial Rabbits Optimization Algorithm with Chaotic Local Search and Opposition-Based Learning for Engineering Problems and Its Applications in Breast Cancer Problem

  • Open Access

    ARTICLE

    Enhanced Heap-Based Optimizer Algorithm for Solving Team Formation Problem

    Nashwa Nageh1, Ahmed Elshamy1, Abdel Wahab Said Hassan1, Mostafa Sami2, Mustafa Abdul Salam3,4,*

    CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 5245-5268, 2022, DOI:10.32604/cmc.2022.030906 - 28 July 2022

    Abstract Team Formation (TF) is considered one of the most significant problems in computer science and optimization. TF is defined as forming the best team of experts in a social network to complete a task with least cost. Many real-world problems, such as task assignment, vehicle routing, nurse scheduling, resource allocation, and airline crew scheduling, are based on the TF problem. TF has been shown to be a Nondeterministic Polynomial time (NP) problem, and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms. This paper proposes two improved swarm-based algorithms for… More >

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