Jiahui Liu^1,2, Lang Li^1,2,*, Di Li^1,2, Yu Ou^1,2

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4641-4657, 2024, DOI:10.32604/cmc.2024.051613

Abstract Correlation power analysis (CPA) combined with genetic algorithms (GA) now achieves greater attack efficiency and can recover all subkeys simultaneously. However, two issues in GA-based CPA still need to be addressed: key degeneration and slow evolution within populations. These challenges significantly hinder key recovery efforts. This paper proposes a screening correlation power analysis framework combined with a genetic algorithm, named SFGA-CPA, to address these issues. SFGA-CPA introduces three operations designed to exploit CPA characteristics: propagative operation, constrained crossover, and constrained mutation. Firstly, the propagative operation accelerates population evolution by maximizing the number of correct bytes… More >

Djeldjli Halima^1,*, Benatiallah Djelloul¹, Ghasri Mehdi², Tanougast Camel³, Benatiallah Ali⁴, Benabdelkrim Bouchra¹

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4725-4740, 2024, DOI:10.32604/cmc.2024.051002

Abstract When designing solar systems and assessing the effectiveness of their many uses, estimating sun irradiance is a crucial first step. This study examined three approaches (ANN, GA-ANN, and ANFIS) for estimating daily global solar radiation (GSR) in the south of Algeria: Adrar, Ouargla, and Bechar. The proposed hybrid GA-ANN model, based on genetic algorithm-based optimization, was developed to improve the ANN model. The GA-ANN and ANFIS models performed better than the standalone ANN-based model, with GA-ANN being better suited for forecasting in all sites, and it performed the best with the best values in the… More > Graphic Abstract

Junqing Bai¹, Qiuchao Dai^1,*, Yingying Li²

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 5083-5103, 2024, DOI:10.32604/cmc.2024.050921

Abstract To support the explosive growth of Information and Communications Technology (ICT), Mobile Edge Computing (MEC) provides users with low latency and high bandwidth service by offloading computational tasks to the network’s edge. However, resource-constrained mobile devices still suffer from a capacity mismatch when faced with latency-sensitive and compute-intensive emerging applications. To address the difficulty of running computationally intensive applications on resource-constrained clients, a model of the computation offloading problem in a network consisting of multiple mobile users and edge cloud servers is studied in this paper. Then a user benefit function EoU (Experience of Users) is… More >

Abdulelah Alwabel^1,*, Chinmaya Kumar Swain²

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4127-4148, 2024, DOI:10.32604/cmc.2024.048833

Abstract Fog computing has recently developed as a new paradigm with the aim of addressing time-sensitive applications better than with cloud computing by placing and processing tasks in close proximity to the data sources. However, the majority of the fog nodes in this environment are geographically scattered with resources that are limited in terms of capabilities compared to cloud nodes, thus making the application placement problem more complex than that in cloud computing. An approach for cost-efficient application placement in fog-cloud computing environments that combines the benefits of both fog and cloud computing to optimize the… More >

Chao-Lung Yang^1,*, Melkamu Mengistnew Teshome¹, Yu-Zhen Yeh¹, Tamrat Yifter Meles²

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 3519-3547, 2024, DOI:10.32604/cmc.2024.048462

Abstract In this study, we introduce a novel multi-objective optimization model tailored for modern manufacturing, aiming to mitigate the cost impacts of operational disruptions through optimized corrective maintenance. Central to our approach is the strategic placement of maintenance stations and the efficient allocation of personnel, addressing a crucial gap in the integration of maintenance personnel dispatching and station selection. Our model uniquely combines the spatial distribution of machinery with the expertise of operators to achieve a harmonious balance between maintenance efficiency and cost-effectiveness. The core of our methodology is the NSGA III+ Dispatch, an advanced adaptation… More >

Zakir Hussain Ahmed^1,*, Habibollah Haron², Abdullah Al-Tameem³

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 2399-2425, 2024, DOI:10.32604/cmc.2024.049704

Abstract Genetic algorithms (GAs) are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems. A simple GA begins with a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes. It uses a crossover operator to create better offspring chromosomes and thus, converges the population. Also, it uses a mutation operator to explore the unexplored areas by the crossover operator, and thus, diversifies the GA search space. A combination of crossover and mutation operators… More >

Parth Khandelwal¹, Harshit², Indranil Manna^1,3,*

CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 1727-1755, 2024, DOI:10.32604/cmc.2024.042752

Abstract Metallic alloys for a given application are usually designed to achieve the desired properties by devising experiments based on experience, thermodynamic and kinetic principles, and various modeling and simulation exercises. However, the influence of process parameters and material properties is often non-linear and non-colligative. In recent years, machine learning (ML) has emerged as a promising tool to deal with the complex interrelation between composition, properties, and process parameters to facilitate accelerated discovery and development of new alloys and functionalities. In this study, we adopt an ML-based approach, coupled with genetic algorithm (GA) principles, to design… More > Graphic Abstract

Rashmi Sharma¹, Ashok Pal¹, Nitin Mittal², Lalit Kumar², Sreypov Van³, Yunyoung Nam^3,*, Mohamed Abouhawwash^4,5

CMC-Computers, Materials & Continua, Vol.78, No.3, pp. 3489-3510, 2024, DOI:10.32604/cmc.2024.046606

Abstract This study proposes a hybridization of two efficient algorithm’s Multi-objective Ant Lion Optimizer Algorithm (MOALO) which is a multi-objective enhanced version of the Ant Lion Optimizer Algorithm (ALO) and the Genetic Algorithm (GA). MOALO version has been employed to address those problems containing many objectives and an archive has been employed for retaining the non-dominated solutions. The uniqueness of the hybrid is that the operators like mutation and crossover of GA are employed in the archive to update the solutions and later those solutions go through the process of MOALO. A first-time hybrid of these… More >

Qinhui Liu, Laizheng Zhu, Zhijie Gao, Jilong Wang, Jiang Li^*

CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 811-843, 2024, DOI:10.32604/cmc.2023.046040

Abstract To improve the productivity, the resource utilization and reduce the production cost of flexible job shops, this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching. Firstly, a mathematical model is established to minimize the maximum completion time. Secondly, an improved two-layer optimization algorithm is designed: the outer layer algorithm uses an improved PSO (Particle Swarm Optimization) to solve the workpiece batching problem, and the inner layer algorithm uses an improved GA (Genetic Algorithm) to solve the dual-resource scheduling problem. Then, a rescheduling method… More >

Liang Zeng^1,2, Junyang Shi¹, Yanyan Li¹, Shanshan Wang^1,2,*, Weigang Li³

CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 375-392, 2024, DOI:10.32604/cmc.2023.045803

Abstract The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems. It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives. The Non-dominated Sorting Genetic Algorithm III (NSGA-III) is an effective approach for solving the multi-objective job shop scheduling problem. Nevertheless, it has some limitations in solving scheduling problems, including inadequate global search capability, susceptibility to premature convergence, and challenges in balancing convergence and diversity. To enhance its performance, this paper introduces a strengthened dominance relation NSGA-III… More >