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 >

Sumika Chauhan¹, Govind Vashishtha^1,*, Riya Singh², Divesh Bharti³

CMES-Computer Modeling in Engineering & Sciences, Vol.144, No.1, pp. 309-343, 2025, DOI:10.32604/cmes.2025.068628 - 31 July 2025

Abstract This paper introduces a novel optimization approach called Recuperated Seed Search Optimization (RSSO), designed to address challenges in solving mechanical engineering design problems. Many optimization techniques struggle with slow convergence and suboptimal solutions due to complex, nonlinear natures. The Sperm Swarm Optimization (SSO) algorithm, which mimics the sperm’s movement to reach an egg, is one such technique. To improve SSO, researchers combined it with three strategies: opposition-based learning (OBL), Cauchy mutation (CM), and position clamping. OBL introduces diversity to SSO by exploring opposite solutions, speeding up convergence. CM enhances both exploration and exploitation capabilities throughout More >

Robertas Damasevicius^*

CMC-Computers, Materials & Continua, Vol.82, No.2, pp. 1493-1538, 2025, DOI:10.32604/cmc.2024.057431 - 17 February 2025

Abstract Heuristic optimization algorithms have been widely used in solving complex optimization problems in various fields such as engineering, economics, and computer science. These algorithms are designed to find high-quality solutions efficiently by balancing exploration of the search space and exploitation of promising solutions. While heuristic optimization algorithms vary in their specific details, they often exhibit common patterns that are essential to their effectiveness. This paper aims to analyze and explore common patterns in heuristic optimization algorithms. Through a comprehensive review of the literature, we identify the patterns that are commonly observed in these algorithms, including… More >

Feyza Altunbey Özbay¹, Erdal Özbay², Farhad Soleimanian Gharehchopogh^3,*

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

Qianyao Zhu¹, Kaizhou Gao^1,*, Wuze Huang¹, Zhenfang Ma¹, Adam Slowik²

CMC-Computers, Materials & Continua, Vol.80, No.3, pp. 3573-3589, 2024, DOI:10.32604/cmc.2024.055244 - 12 September 2024

Abstract The flow shop scheduling problem is important for the manufacturing industry. Effective flow shop scheduling can bring great benefits to the industry. However, there are few types of research on Distributed Hybrid Flow Shop Problems (DHFSP) by learning assisted meta-heuristics. This work addresses a DHFSP with minimizing the maximum completion time (Makespan). First, a mathematical model is developed for the concerned DHFSP. Second, four Q-learning-assisted meta-heuristics, e.g., genetic algorithm (GA), artificial bee colony algorithm (ABC), particle swarm optimization (PSO), and differential evolution (DE), are proposed. According to the nature of DHFSP, six local search operations… More >

Sana Jawarneh^*

Intelligent Automation & Soft Computing, Vol.39, No.3, pp. 511-525, 2024, DOI:10.32604/iasc.2024.047126 - 11 July 2024

Abstract High-dimensional datasets present significant challenges for classification tasks. Dimensionality reduction, a crucial aspect of data preprocessing, has gained substantial attention due to its ability to improve classification performance. However, identifying the optimal features within high-dimensional datasets remains a computationally demanding task, necessitating the use of efficient algorithms. This paper introduces the Arithmetic Optimization Algorithm (AOA), a novel approach for finding the optimal feature subset. AOA is specifically modified to address feature selection problems based on a transfer function. Additionally, two enhancements are incorporated into the AOA algorithm to overcome limitations such as limited precision, slow More >

Muchang Rao, Hang Qin^*

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 2647-2672, 2024, DOI:10.32604/cmc.2024.050380 - 15 May 2024

Abstract More devices in the Intelligent Internet of Things (AIoT) result in an increased number of tasks that require low latency and real-time responsiveness, leading to an increased demand for computational resources. Cloud computing’s low-latency performance issues in AIoT scenarios have led researchers to explore fog computing as a complementary extension. However, the effective allocation of resources for task execution within fog environments, characterized by limitations and heterogeneity in computational resources, remains a formidable challenge. To tackle this challenge, in this study, we integrate fog computing and cloud computing. We begin by establishing a fog-cloud environment… More >

Chuan Wang^1,*, Ruoyu Zhu², Yi Jiang³, Weili Liu⁴, Sang-Woon Jeon⁵, Lin Sun², Hua Wang⁶

CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.2, pp. 1209-1228, 2023, DOI:10.32604/cmes.2022.022807 - 27 October 2022

Abstract The dynamic traveling salesman problem (DTSP) is significant in logistics distribution in real-world applications in smart cities, but it is uncertain and difficult to solve. This paper proposes a scheme library-based ant colony optimization (ACO) with a two-optimization (2-opt) strategy to solve the DTSP efficiently. The work is novel and contributes to three aspects: problem model, optimization framework, and algorithm design. Firstly, in the problem model, traditional DTSP models often consider the change of travel distance between two nodes over time, while this paper focuses on a special DTSP model in that the node locations… More >

Nashwa Nageh¹, Ahmed Elshamy¹, Abdel Wahab Said Hassan¹, Mostafa Sami², Mustafa Abdul Salam^3,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 >

Wajaree Weera¹, Zulqurnain Sabir², Muhammad Asif Zahoor Raja³, Sakda Noinang⁴, Thongchai Botmart^1,*

CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 4833-4849, 2022, DOI:10.32604/cmc.2022.030888 - 28 July 2022

Abstract The purpose of this research is to construct an integrated neuro swarming scheme using the procedures of the artificial neural networks (ANNs) with the use of global search particle swarm optimization (PSO) along with the competent local search interior-point programming (IPP) called as ANN-PSOIPP. The proposed computational scheme is implemented for the numerical simulations of the third order nonlinear delay differential Emden-Fowler model (TON-DD-EFM). The TON-DD-EFM is based on two types along with the particulars of shape factor, delayed terms, and singular points. A merit function is performed using the optimization of PSOIPP to find More >