Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    An Opposition-Based Learning-Based Search Mechanism for Flying Foxes Optimization Algorithm

    Chen Zhang1, Liming Liu1, Yufei Yang1, Yu Sun1, Jiaxu Ning2, Yu Zhang3, Changsheng Zhang1,4,*, Ying Guo4

    CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 5201-5223, 2024, DOI:10.32604/cmc.2024.050863 - 20 June 2024

    Abstract The flying foxes optimization (FFO) algorithm, as a newly introduced metaheuristic algorithm, is inspired by the survival tactics of flying foxes in heat wave environments. FFO preferentially selects the best-performing individuals. This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area. To address this issue, the paper introduces an opposition-based learning-based search mechanism for FFO algorithm (IFFO). Firstly, this paper introduces niching techniques to improve the survival list method, which not only focuses on the adaptability of individuals but also considers the population’s crowding degree More >

  • Open Access

    ARTICLE

    Path-Based Clustering Algorithm with High Scalability Using the Combined Behavior of Evolutionary Algorithms

    Leila Safari-Monjeghtapeh1, Mansour Esmaeilpour2,*

    Computer Systems Science and Engineering, Vol.48, No.3, pp. 705-721, 2024, DOI:10.32604/csse.2024.044892 - 20 May 2024

    Abstract Path-based clustering algorithms typically generate clusters by optimizing a benchmark function. Most optimization methods in clustering algorithms often offer solutions close to the general optimal value. This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance, Maximum Spanning Tree “MST”, and meta-heuristic algorithms, including Genetic Algorithm “GA” and Particle Swarm Optimization “PSO”. The Fast Path-based Clustering “FPC” algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations. The FPC does this operation using MST, the minimax distance, and… More >

  • Open Access

    ARTICLE

    Optimizing Deep Learning for Computer-Aided Diagnosis of Lung Diseases: An Automated Method Combining Evolutionary Algorithm, Transfer Learning, and Model Compression

    Hassen Louati1,2, Ali Louati3,*, Elham Kariri3, Slim Bechikh2

    CMES-Computer Modeling in Engineering & Sciences, Vol.138, No.3, pp. 2519-2547, 2024, DOI:10.32604/cmes.2023.030806 - 15 December 2023

    Abstract Recent developments in Computer Vision have presented novel opportunities to tackle complex healthcare issues, particularly in the field of lung disease diagnosis. One promising avenue involves the use of chest X-Rays, which are commonly utilized in radiology. To fully exploit their potential, researchers have suggested utilizing deep learning methods to construct computer-aided diagnostic systems. However, constructing and compressing these systems presents a significant challenge, as it relies heavily on the expertise of data scientists. To tackle this issue, we propose an automated approach that utilizes an evolutionary algorithm (EA) to optimize the design and compression More >

  • Open Access

    ARTICLE

    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

    Shehab Abdulhabib Alzaeemi1, Kim Gaik Tay1,*, Audrey Huong1, Saratha Sathasivam2, Majid Khan bin Majahar Ali2

    Computer Systems Science and Engineering, Vol.47, No.1, pp. 1163-1184, 2023, DOI:10.32604/csse.2023.038912 - 26 May 2023

    Abstract Radial Basis Function Neural Network (RBFNN) ensembles have long suffered from non-efficient training, where incorrect parameter settings can be computationally disastrous. This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network (SRBFNN) through the behavior’s integration of satisfiability programming. Inspired by evolutionary algorithms, which can iteratively find the near-optimal solution, different Evolutionary Algorithms (EAs) were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation (SRBFNN-2SAT). The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different… More >

  • Open Access

    ARTICLE

    Managing Health Treatment by Optimizing Complex Lab-Developed Test Configurations: A Health Informatics Perspective

    Uzma Afzal1, Tariq Mahmood2, Ali Mustafa Qamar3,*, Ayaz H. Khan4,5

    CMC-Computers, Materials & Continua, Vol.75, No.3, pp. 6251-6267, 2023, DOI:10.32604/cmc.2023.037653 - 29 April 2023

    Abstract A complex Laboratory Developed Test (LDT) is a clinical test developed within a single laboratory. It is typically configured from many feature constraints from clinical repositories, which are part of the existing Laboratory Information Management System (LIMS). Although these clinical repositories are automated, support for managing patient information with test results of an LDT is also integrated within the existing LIMS. Still, the support to configure LDTs design needs to be made available even in standard LIMS packages. The manual configuration of LDTs is a complex process and can generate configuration inconsistencies because many constraints… More >

  • Open Access

    ARTICLE

    Minimizing Total Tardiness in a Two-Machine Flowshop Scheduling Problem with Availability Constraints

    Mohamed Ali Rakrouki1,2,*, Abeer Aljohani1, Nawaf Alharbe1, Abdelaziz Berrais2, Talel Ladhari2

    Intelligent Automation & Soft Computing, Vol.35, No.1, pp. 1119-1134, 2023, DOI:10.32604/iasc.2023.028604 - 06 June 2022

    Abstract In this paper, we consider the problem of minimizing the total tardiness in a deterministic two-machine permutation flowshop scheduling problem subject to release dates of jobs and known unavailability periods of machines. The theoretical and practical importance of minimizing tardiness in flowshop scheduling environment has motivated us to investigate and solve this interested two-machine scheduling problem. Methods that solve this important optimality criterion in flowshop environment are mainly heuristics. In fact, despite the -hardness in the strong sense of the studied problem, to the best of our knowledge there are no approximate algorithms (constructive heuristics… More >

  • Open Access

    ARTICLE

    Maintain Optimal Configurations for Large Configurable Systems Using Multi-Objective Optimization

    Muhammad Abid Jamil1,*, Deafallah Alsadie1, Mohamed K. Nour1, Normi Sham Awang Abu Bakar2

    CMC-Computers, Materials & Continua, Vol.73, No.2, pp. 4407-4422, 2022, DOI:10.32604/cmc.2022.029096 - 16 June 2022

    Abstract To improve the maintenance and quality of software product lines, efficient configurations techniques have been proposed. Nevertheless, due to the complexity of derived and configured products in a product line, the configuration process of the software product line (SPL) becomes time-consuming and costly. Each product line consists of a various number of feature models that need to be tested. The different approaches have been presented by Search-based software engineering (SBSE) to resolve the software engineering issues into computational solutions using some metaheuristic approach. Hence, multiobjective evolutionary algorithms help to optimize the configuration process of SPL. More >

  • Open Access

    ARTICLE

    Managing Software Testing Technical Debt Using Evolutionary Algorithms

    Muhammad Abid Jamil*, Mohamed K. Nour

    CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 735-747, 2022, DOI:10.32604/cmc.2022.028386 - 18 May 2022

    Abstract Technical debt (TD) happens when project teams carry out technical decisions in favor of a short-term goal(s) in their projects, whether deliberately or unknowingly. TD must be properly managed to guarantee that its negative implications do not outweigh its advantages. A lot of research has been conducted to show that TD has evolved into a common problem with considerable financial burden. Test technical debt is the technical debt aspect of testing (or test debt). Test debt is a relatively new concept that has piqued the curiosity of the software industry in recent years. In this… More >

  • Open Access

    ARTICLE

    Differential Evolution Algorithm with Hierarchical Fair Competition Model

    Amit Ramesh Khaparde1,*, Fawaz Alassery2, Arvind Kumar3, Youseef Alotaibi4, Osamah Ibrahim Khalaf5, Sofia Pillai6, Saleh Alghamdi7

    Intelligent Automation & Soft Computing, Vol.33, No.2, pp. 1045-1062, 2022, DOI:10.32604/iasc.2022.023270 - 08 February 2022

    Abstract This paper presents the study of differential evolution algorithm with hierarchical fair competition model (HFC-DE). HFC model is based on the fair competition of societal system found in natural world. In this model, the population is split into hierarchy and the competition is allowed between the hierarchical members. During evolution, the population members are allowed to move within the hierarchy levels. The standard differential evolution algorithm is used for population evolution. Experimentation has carried out to define the parameter for proposed model on test suit having unimodal problems and multi-model problems. After analyzing the results, More >

  • Open Access

    REVIEW

    Optimization of Reliability–Redundancy Allocation Problems: A Review of the Evolutionary Algorithms

    Haykel Marouani1,2, Omar Al-mutiri1,*

    CMC-Computers, Materials & Continua, Vol.71, No.1, pp. 537-571, 2022, DOI:10.32604/cmc.2022.020098 - 03 November 2021

    Abstract The study of optimization methods for reliability–redundancy allocation problems is a constantly changing field. New algorithms are continually being designed on the basis of observations of nature, wildlife, and humanity. In this paper, we review eight major evolutionary algorithms that emulate the behavior of civilization, ants, bees, fishes, and birds (i.e., genetic algorithms, bee colony optimization, simulated annealing, particle swarm optimization, biogeography-based optimization, artificial immune system optimization, cuckoo algorithm and imperialist competitive algorithm). We evaluate the mathematical formulations and pseudo-codes of each algorithm and discuss how these apply to reliability–redundancy allocation problems. Results from a More >

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