Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    An Adaptive Hybrid Metaheuristic for Solving the Vehicle Routing Problem with Time Windows under Uncertainty

    Manuel J. C. S. Reis*

    CMC-Computers, Materials & Continua, Vol.85, No.2, pp. 3023-3039, 2025, DOI:10.32604/cmc.2025.066390 - 23 September 2025

    Abstract The Vehicle Routing Problem with Time Windows (VRPTW) presents a significant challenge in combinatorial optimization, especially under real-world uncertainties such as variable travel times, service durations, and dynamic customer demands. These uncertainties make traditional deterministic models inadequate, often leading to suboptimal or infeasible solutions. To address these challenges, this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms (GA) with Local Search (LS), while incorporating stochastic uncertainty modeling through probabilistic travel times. The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance. This adaptivity enhances the algorithm’s… More >

  • Open Access

    ARTICLE

    Dynamic Multi-Objective Gannet Optimization (DMGO): An Adaptive Algorithm for Efficient Data Replication in Cloud Systems

    P. William1,2, Ved Prakash Mishra1, Osamah Ibrahim Khalaf3,*, Arvind Mukundan4, Yogeesh N5, Riya Karmakar6

    CMC-Computers, Materials & Continua, Vol.84, No.3, pp. 5133-5156, 2025, DOI:10.32604/cmc.2025.065840 - 30 July 2025

    Abstract Cloud computing has become an essential technology for the management and processing of large datasets, offering scalability, high availability, and fault tolerance. However, optimizing data replication across multiple data centers poses a significant challenge, especially when balancing opposing goals such as latency, storage costs, energy consumption, and network efficiency. This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization (DMGO), designed to enhance data replication efficiency in cloud environments. Unlike traditional static replication systems, DMGO adapts dynamically to variations in network conditions, system demand, and resource availability. The approach utilizes multi-objective optimization More >

  • Open Access

    ARTICLE

    Adaptive Signal Enhancement Unit for EEG Analysis in Remote Patient Care Monitoring Systems

    Ch. Srinivas1,*, K. Chandrabhushana Rao2

    CMC-Computers, Materials & Continua, Vol.67, No.2, pp. 1801-1817, 2021, DOI:10.32604/cmc.2021.014981 - 05 February 2021

    Abstract In this paper we propose an efficient process of physiological artifact elimination methodology from brain waves (BW), which are also commonly known as electroencephalogram (EEG) signal. In a clinical environment during the acquisition of BW several artifacts contaminates the actual BW component. This leads to inaccurate and ambiguous diagnosis. As the statistical nature of the EEG signal is more non-stationery, adaptive filtering is the more promising method for the process of artifact elimination. In clinical conditions, the conventional adaptive techniques require many numbers of computational operations and leads to data samples overlapping and instability of… More >

  • Open Access

    ARTICLE

    Developing an Adaptation Process for Real-Coded Genetic Algorithms

    Ridvan Saraçoğlu*, Ahmet Fatih Kazankaya

    Computer Systems Science and Engineering, Vol.35, No.1, pp. 13-19, 2020, DOI:10.32604/csse.2020.35.013

    Abstract The genetic algorithm (GA) is a metaheuristic method which simulates the life cycle and the survival of the fittest in the nature for solving optimization problems. This study aimed to develop enhanced operation by modifying the current GA. This development process includes an adaptation method that contains certain developments and adds a new process to the classic algorithm. Individuals of a population will be trialed to adapt to the current solution of the problem by taking them separately for each generation. With this adaptation method, it is more likely to get better results in a More >

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