Yu Cheng^1,2,5, Yajun Huang³, Shuai Li⁴, Zhongbin Zhou⁵, Xiaohui Yuan^1,2,*, Yanming Xu^5,*

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1935-1960, 2024, DOI:10.32604/cmes.2023.045668

Abstract A new approach for flexoelectric material shape optimization is proposed in this study. In this work, a proxy model based on artificial neural network (ANN) is used to solve the parameter optimization and shape optimization problems. To improve the fitting ability of the neural network, we use the idea of pre-training to determine the structure of the neural network and combine different optimizers for training. The isogeometric analysis-finite element method (IGA-FEM) is used to discretize the flexural theoretical formulas and obtain samples, which helps ANN to build a proxy model from the model shape to the target value. The effectiveness… More >

Mariem Belhor^1,2,3, Adnen El-Amraoui^1,*, Abderrazak Jemai², François Delmotte¹

Computer Systems Science and Engineering, Vol.48, No.1, pp. 271-271, 2024, DOI:10.32604/csse.2023.048573

Abstract This article has no abstract. More >

Elif Varol Altay, Osman Altay, Yusuf Özçevik^*

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.1, pp. 1039-1094, 2024, DOI:10.32604/cmes.2023.029404

Abstract Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve. Such design problems are widely experienced in many engineering fields, such as industry, automotive, construction, machinery, and interdisciplinary research. However, there are established optimization techniques that have shown effectiveness in addressing these types of issues. This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues. The algorithms used in the study are listed as: transient search optimization (TSO), equilibrium optimizer (EO), grey wolf optimizer (GWO), moth-flame optimization (MFO), whale… More >

Zhenyu Yan^1,*, Haotian Bian²

Computer Systems Science and Engineering, Vol.47, No.2, pp. 2241-2257, 2023, DOI:10.32604/csse.2023.040603

Abstract As millimeter waves will be widely used in the Internet of Things (IoT) and Telematics to provide high bandwidth communication and mass connectivity, the coverage optimization of base stations can effectively improve the quality of communication services. How to optimize the convergence speed of the base station coverage solution is crucial for IoT service providers. This paper proposes the Muti-Fusion Sparrow Search Algorithm (MFSSA) optimize the situation to address the problem of discrete coverage maximization and rapid convergence. Firstly, the initial swarm diversity is enriched using a sine chaotic map, and dynamic adaptive weighting is added to the discoverer location… More >

Hao Cui, Yanling Guo^*, Yaning Xiao, Yangwei Wang^*, Jian Li, Yapeng Zhang, Haoyu Zhang

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1635-1675, 2023, DOI:10.32604/cmes.2023.026019

Abstract Harris Hawks Optimization (HHO) is a novel meta-heuristic algorithm that imitates the predation characteristics of Harris Hawk and combines Lévy flight to solve complex multidimensional problems. Nevertheless, the basic HHO algorithm still has certain limitations, including the tendency to fall into the local optima and poor convergence accuracy. Coot Bird Optimization (CBO) is another new swarm-based optimization algorithm. CBO originates from the regular and irregular motion of a bird called Coot on the water’s surface. Although the framework of CBO is slightly complicated, it has outstanding exploration potential and excellent capability to avoid falling into local optimal solutions. This paper… More > Graphic Abstract

Pavel Trojovský^*, Mohammad Dehghani

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1695-1730, 2023, DOI:10.32604/cmes.2023.028314

Abstract This paper introduces a new metaheuristic algorithm called Migration Algorithm (MA), which is helpful in solving optimization problems. The fundamental inspiration of MA is the process of human migration, which aims to improve job, educational, economic, and living conditions, and so on. The mathematical modeling of the proposed MA is presented in two phases to empower the proposed approach in exploration and exploitation during the search process. In the exploration phase, the algorithm population is updated based on the simulation of choosing the migration destination among the available options. In the exploitation phase, the algorithm population is updated based on… More >

Dongyang Li¹, Shiyu Du^2,*, Yiming Zhang², Meiting Zhao³

CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 2775-2803, 2023, DOI:10.32604/cmc.2023.035911

Abstract Metaheuristic algorithms, as effective methods for solving optimization problems, have recently attracted considerable attention in science and engineering fields. They are popular and have broad applications owing to their high efficiency and low complexity. These algorithms are generally based on the behaviors observed in nature, physical sciences, or humans. This study proposes a novel metaheuristic algorithm called dark forest algorithm (DFA), which can yield improved optimization results for global optimization problems. In DFA, the population is divided into four groups: highest civilization, advanced civilization, normal civilization, and low civilization. Each civilization has a unique way of iteration. To verify DFA’s… More >

Wenchao Yi, Zhilei Lin, Yong Chen, Zhi Pei^*, Jiansha Lu

CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.3, pp. 2841-2860, 2023, DOI:10.32604/cmes.2023.027055

Abstract Effective constrained optimization algorithms have been proposed for engineering problems recently. It is common to consider constraint violation and optimization algorithm as two separate parts. In this study, a pbest selection mechanism is proposed to integrate the current mutation strategy in constrained optimization problems. Based on the improved pbest selection method, an adaptive differential evolution approach is proposed, which helps the population jump out of the infeasible region. If all the individuals are infeasible, the top 5% of infeasible individuals are selected. In addition, a modified truncated ε-level method is proposed to avoid trapping in infeasible regions. The proposed adaptive… More > Graphic Abstract

Wenchuan Wang^1,*, Weican Tian¹, Kwok-wing Chau², Yiming Xue¹, Lei Xu³, Hongfei Zang¹

CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.2, pp. 1603-1642, 2023, DOI:10.32604/cmes.2023.026231

Abstract The Bald Eagle Search algorithm (BES) is an emerging meta-heuristic algorithm. The algorithm simulates the hunting behavior of eagles, and obtains an optimal solution through three stages, namely selection stage, search stage and swooping stage. However, BES tends to drop-in local optimization and the maximum value of search space needs to be improved. To fill this research gap, we propose an improved bald eagle algorithm (CABES) that integrates Cauchy mutation and adaptive optimization to improve the performance of BES from local optima. Firstly, CABES introduces the Cauchy mutation strategy to adjust the step size of the selection stage, to select… More >

Pavel Trojovský^1,*, Mohammad Dehghani¹, Eva Trojovská¹, Eva Milkova²

CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.2, pp. 1527-1573, 2023, DOI:10.32604/cmes.2023.025908

Abstract In this paper, based on the concept of the NFL theorem, that there is no unique algorithm that has the best performance for all optimization problems, a new human-based metaheuristic algorithm called Language Education Optimization (LEO) is introduced, which is used to solve optimization problems. LEO is inspired by the foreign language education process in which a language teacher trains the students of language schools in the desired language skills and rules. LEO is mathematically modeled in three phases: (i) students selecting their teacher, (ii) students learning from each other, and (iii) individual practice, considering exploration in local search and… More > Graphic Abstract