Optimal solution of engineering design problems through differential gradient evolution plus algorithm: a hybrid approach

2021 ◽  
Author(s):  
Muhammad Farhan Tabassum ◽  
Ali Akgul ◽  
Sana Akram ◽  
Saadia Hassan ◽  
. Saman ◽  
...  

Abstract It is very necessary and applicable to optimize all disciplines. In practical engineering problems the optimization has been a significant component. This article presents the hybrid approach named as differential gradient evolution plus (DGE+) algorithm which is the combination of differential evolution (DE) algorithm and gradient evolution (GE) algorithm. DE was used to diversify and GE was used for intensification with a perfect equilibrium between exploration and exploitation with an improvised distribution of dynamic probability and offers a new shake-off approach to prevent premature convergence to local optimum. To describe the success, the proposed algorithm is compared to modern meta-heuristics. To see the accuracy, robustness, and reliability of DGE+ it has been implemented on eight complex practical engineering problems named as: pressure vessel, belleville spring, tension/compression spring, three-bar truss, welded beam, speed reducer, gear train and rolling element bearing design problem, the results revealed that DGE+ algorithm can deliver highly efficient, competitive and promising results.

Author(s):  
Muhammad Farhan Tabassum ◽  
Sana Akram ◽  
Saadia Mahmood-ul-Hassan ◽  
Rabia Karim ◽  
Parvaiz Ahmad Naik ◽  
...  

Optimization for all disciplines is very important and applicable. Optimization has played a key role in practical engineering problems. A novel hybrid meta-heuristic optimization algorithm that is based on Differential Evolution (DE), Gradient Evolution (GE) and Jumping Technique named Differential Gradient Evolution Plus (DGE+) are presented in this paper. The proposed algorithm hybridizes the above-mentioned algorithms with the help of an improvised dynamic probability distribution, additionally provides a new shake off method to avoid premature convergence towards local minima. To evaluate the efficiency, robustness, and reliability of DGE+ it has been applied on seven benchmark constraint problems, the results of comparison revealed that the proposed algorithm can provide very compact, competitive and promising performance.


2017 ◽  
Vol 26 (4) ◽  
pp. 729-740 ◽  
Author(s):  
Shuliang Zhou ◽  
Dongqing Feng ◽  
Panpan Ding

AbstractArtificial bee colony (ABC) is a kind of a metaheuristic population-based algorithms proposed in 2005. Due to its simple parameters and flexibility, the ABC algorithm is applied to engineering problems, algebra problems, and so on. However, its premature convergence and slow convergence speed are inherent shortcomings. Aiming at the shortcomings, a novel global ABC algorithm with self-perturbing (IGABC) is proposed in this paper. On the basis of the original search equation, IGABC adopts a novel self-adaptive search equation, introducing the guidance of the global optimal solution. The search method improves the convergence precision and the global search capacity. An excellent leader can lead the whole team to obtain more success. In order to obtain a better “leader,” IGABC proposes a novel method with global self-perturbing. To avoid falling into the local optimum, this paper designed a new mutation strategy that simulates the natural phenomenon of sick fish being eaten.


2022 ◽  
Vol 19 (3) ◽  
pp. 2240-2285
Author(s):  
Shihong Yin ◽  
◽  
Qifang Luo ◽  
Yanlian Du ◽  
Yongquan Zhou ◽  
...  

<abstract> <p>The slime mould algorithm (SMA) is a metaheuristic algorithm recently proposed, which is inspired by the oscillations of slime mould. Similar to other algorithms, SMA also has some disadvantages such as insufficient balance between exploration and exploitation, and easy to fall into local optimum. This paper, an improved SMA based on dominant swarm with adaptive t-distribution mutation (DTSMA) is proposed. In DTSMA, the dominant swarm is used improved the SMA's convergence speed, and the adaptive t-distribution mutation balances is used enhanced the exploration and exploitation ability. In addition, a new exploitation mechanism is hybridized to increase the diversity of populations. The performances of DTSMA are verified on CEC2019 functions and eight engineering design problems. The results show that for the CEC2019 functions, the DTSMA performances are best; for the engineering problems, DTSMA obtains better results than SMA and many algorithms in the literature when the constraints are satisfied. Furthermore, DTSMA is used to solve the inverse kinematics problem for a 7-DOF robot manipulator. The overall results show that DTSMA has a strong optimization ability. Therefore, the DTSMA is a promising metaheuristic optimization for global optimization problems.</p> </abstract>


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-33
Author(s):  
GuoChun Wang ◽  
Wenyong Gui ◽  
Guoxi Liang ◽  
Xuehua Zhao ◽  
Mingjing Wang ◽  
...  

The whale optimization algorithm (WOA) is a high-performance metaheuristic algorithm that can effectively solve many practical problems and broad application prospects. However, the original algorithm has a significant improvement in space in solving speed and precision. It is easy to fall into local optimization when facing complex or high-dimensional problems. To solve these shortcomings, an elite strategy and spiral motion from moth flame optimization are utilized to enhance the original algorithm’s efficiency, called MEWOA. Using these two methods to build a more superior population, MEWOA further balances the exploration and exploitation phases and makes it easier for the algorithm to get rid of the local optimum. To show the proposed method’s performance, MEWOA is contrasted to other superior algorithms on a series of comprehensive benchmark functions and applied to practical engineering problems. The experimental data reveal that the MEWOA is better than the contrast algorithms in convergence speed and solution quality. Hence, it can be concluded that MEWOA has great potential in global optimization.


2020 ◽  
Vol 37 (9) ◽  
pp. 3543-3566
Author(s):  
Deniz Ustun

Purpose This study aims to evolve an enhanced butterfly optimization algorithm (BOA) with respect to convergence and accuracy performance for numerous benchmark functions, rigorous constrained engineering design problems and an inverse synthetic aperture radar (ISAR) image motion compensation. Design/methodology/approach Adaptive BOA (ABOA) is thus developed by incorporating spatial dispersal strategy to the global search and inserting the fittest solution to the local search, and hence its exploration and exploitation abilities are improved. Findings The accuracy and convergence performance of ABOA are well verified via exhaustive comparisons with BOA and its existing variants such as improved BOA (IBOA), modified BOA (MBOA) and BOA with Levy flight (BOAL) in terms of various precise metrics through 15 classical and 12 conference on evolutionary computation (CEC)-2017 benchmark functions. ABOA has outstanding accuracy and stability performance better than BOA, IBOA, MBOA and BOAL for most of the benchmarks. The design optimization performance of ABOA is also evaluated for three constrained engineering problems such as welded beam design, spring design and gear train design and the results are compared with those of BOA, MBOA and BOA with chaos. ABOA, therefore, optimizes engineering designs with the most optimal variables. Furthermore, a validation is performed through translational motion compensation (TMC) of the ISAR image for an aircraft, which includes blurriness. In TMC, the motion parameters such as velocity and acceleration of target are optimally predicted by the optimization algorithms. The TMC results are elaborately compared with BOA, IBOA, MBOA and BOAL between each other in view of images, motion parameter and numerical image measuring metrics. Originality/value The outperforming results reflect the optimization and design successes of ABOA which is enhanced by establishing better global and local search abilities over BOA and its existing variants.


2020 ◽  
Vol 8 (6) ◽  
pp. 4843-4855

The algorithms that have been developed recently have decorous behavior to solve and find optimum solution to various optimization problems in search space. Withal such calculations stuck in issues nearby quest space for compelled engineering problems. In succession to achieve an optimal solution a hybrid algorithmic approach is proffered. Artificial Neural Network (ANN) is considered as better solution for the known outputs. A hybrid variant of applying ANN on Harris Hawks and Whale Optimization Algorithm (ANNHHOWOA) is proposed to achieve effective solution for engineering problems. The effectiveness of proposed algorithm is tested for various nonlinear, non-convex and standard engineering problems and to approve consequences of proposed algorithm standard benchmarks and multidisciplinary design problems have been considered. The validation endorsed that the results shown by ANNHHOWOA showed much better results than individual ANN, HHO and WOA and its effectiveness on multidisciplinary engineering problems.


2014 ◽  
Vol 8 (1) ◽  
pp. 723-728 ◽  
Author(s):  
Chenhao Niu ◽  
Xiaomin Xu ◽  
Yan Lu ◽  
Mian Xing

Short time load forecasting is essential for daily planning and operation of electric power system. It is the important basis for economic dispatching, scheduling and safe operation. Neural network, which has strong nonlinear fitting capability, is widely used in the load forecasting and obtains good prediction effect in nonlinear chaotic time series forecasting. However, the neural network is easy to fall in local optimum, unable to find the global optimal solution. This paper will integrate the traditional optimization algorithm and propose the hybrid intelligent optimization algorithm based on particle swarm optimization algorithm and ant colony optimization algorithm (ACO-PSO) to improve the generalization of the neural network. In the empirical analysis, we select electricity consumption in a certain area for validation. Compared with the traditional BP neutral network and statistical methods, the experimental results demonstrate that the performance of the improved model with more precise results and stronger generalization ability is much better than the traditional methods.


Fuels ◽  
2021 ◽  
Vol 2 (3) ◽  
pp. 286-303
Author(s):  
Vuong Van Pham ◽  
Ebrahim Fathi ◽  
Fatemeh Belyadi

The success of machine learning (ML) techniques implemented in different industries heavily rely on operator expertise and domain knowledge, which is used in manually choosing an algorithm and setting up the specific algorithm parameters for a problem. Due to the manual nature of model selection and parameter tuning, it is impossible to quantify or evaluate the quality of this manual process, which in turn limits the ability to perform comparison studies between different algorithms. In this study, we propose a new hybrid approach for developing machine learning workflows to help automated algorithm selection and hyperparameter optimization. The proposed approach provides a robust, reproducible, and unbiased workflow that can be quantified and validated using different scoring metrics. We have used the most common workflows implemented in the application of artificial intelligence (AI) and ML in engineering problems including grid/random search, Bayesian search and optimization, genetic programming, and compared that with our new hybrid approach that includes the integration of Tree-based Pipeline Optimization Tool (TPOT) and Bayesian optimization. The performance of each workflow is quantified using different scoring metrics such as Pearson correlation (i.e., R2 correlation) and Mean Square Error (i.e., MSE). For this purpose, actual field data obtained from 1567 gas wells in Marcellus Shale, with 121 features from reservoir, drilling, completion, stimulation, and operation is tested using different proposed workflows. A proposed new hybrid workflow is then used to evaluate the type well used for evaluation of Marcellus shale gas production. In conclusion, our automated hybrid approach showed significant improvement in comparison to other proposed workflows using both scoring matrices. The new hybrid approach provides a practical tool that supports the automated model and hyperparameter selection, which is tested using real field data that can be implemented in solving different engineering problems using artificial intelligence and machine learning. The new hybrid model is tested in a real field and compared with conventional type wells developed by field engineers. It is found that the type well of the field is very close to P50 predictions of the field, which shows great success in the completion design of the field performed by field engineers. It also shows that the field average production could have been improved by 8% if shorter cluster spacing and higher proppant loading per cluster were used during the frac jobs.


Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 597
Author(s):  
Kun Miao ◽  
Qian Feng ◽  
Wei Kuang

The particle swarm optimization algorithm (PSO) is a widely used swarm-based natural inspired optimization algorithm. However, it suffers search stagnation from being trapped into a sub-optimal solution in an optimization problem. This paper proposes a novel hybrid algorithm (SDPSO) to improve its performance on local searches. The algorithm merges two strategies, the static exploitation (SE, a velocity updating strategy considering inertia-free velocity), and the direction search (DS) of Rosenbrock method, into the original PSO. With this hybrid, on the one hand, extensive exploration is still maintained by PSO; on the other hand, the SE is responsible for locating a small region, and then the DS further intensifies the search. The SDPSO algorithm was implemented and tested on unconstrained benchmark problems (CEC2014) and some constrained engineering design problems. The performance of SDPSO is compared with that of other optimization algorithms, and the results show that SDPSO has a competitive performance.


Author(s):  
Heming Jia ◽  
Kangjian Sun ◽  
Wanying Zhang ◽  
Xin Leng

AbstractChimp optimization algorithm (ChOA) is a recently proposed metaheuristic. Interestingly, it simulates the social status relationship and hunting behavior of chimps. Due to the more flexible and complex application fields, researchers have higher requirements for native algorithms. In this paper, an enhanced chimp optimization algorithm (EChOA) is proposed to improve the accuracy of solutions. First, the highly disruptive polynomial mutation is used to initialize the population, which provides the foundation for global search. Next, Spearman’s rank correlation coefficient of the chimps with the lowest social status is calculated with respect to the leader chimp. To reduce the probability of falling into the local optimum, the beetle antennae operator is used to improve the less fit chimps while gaining visual capability. Three strategies enhance the exploration and exploitation of the native algorithm. To verify the function optimization performance, EChOA is comprehensively analyzed on 12 classical benchmark functions and 15 CEC2017 benchmark functions. Besides, the practicability of EChOA is also highlighted by three engineering design problems and training multilayer perceptron. Compared with ChOA and five state-of-the-art algorithms, the statistical results show that EChOA has strong competitive capabilities and promising prospects.


Sign in / Sign up

Export Citation Format

Share Document