Differential Evolution Applied to the Design of a Three-Dimensional Vehicular Structure

2007 ◽  
Author(s):  
Felipe Antonio Chegury Viana ◽  
Fernando Ce´sar Gama de Oliveira ◽  
Jose Antonio Ferreria Borges ◽  
Valder Steffen
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Three Dimensional ◽  
Differential Evolution Algorithm ◽  
Basic Algorithm ◽  
Present Contribution ◽  
Finite Element Software ◽  
Design Variables ◽  
Numerical Noise ◽  
Discrete Design Variables

The purpose of this paper is to demonstrate the application of Differential Evolution to a realistic design optimization test problem. The present contribution regards the improvements implemented to the original basic algorithm as well as the application of a new algorithm for dealing with the unique challenges associated with real world optimization problems. The selected example is a three-dimensional vehicular structure optimization problem modeled using the commercial Finite Element software ANSYS® that has a combination of continuous and discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the Differential Evolution algorithm is able to find the optimum design for the proposed problem. The algorithm is robust in the sense that it is capable of dealing with the numerical noise involved in the modeling of the system and to manipulate discrete design variables, accordingly.

scholarly journals Differential Evolution with Linear Bias Reduction in Parameter Adaptation

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 283
Author(s):  
Vladimir Stanovov ◽  
Shakhnaz Akhmedova ◽  
Eugene Semenkin
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Bias Reduction ◽  
Benchmark Problems ◽  
Basic Algorithm ◽  
Optimization Stage ◽  
Speed Up ◽  
Comparison Of The Results ◽  
Lehmer Mean

In this study, a new parameter control scheme is proposed for the differential evolution algorithm. The developed linear bias reduction scheme controls the Lehmer mean parameter value depending on the optimization stage, allowing the algorithm to improve the exploration properties at the beginning of the search and speed up the exploitation at the end of the search. As a basic algorithm, the L-SHADE approach is considered, as well as its modifications, namely the jSO and DISH algorithms. The experiments are performed on the CEC 2017 and 2020 bound-constrained benchmark problems, and the performed statistical comparison of the results demonstrates that the linear bias reduction allows significant improvement of the differential evolution performance for various types of optimization problems.

Design Optimization of Aircraft Engine-Mount Systems

1993 ◽  
Author(s):  
Hashem Ashrafiuon
Keyword(s):  
Design Optimization ◽  
Vibration Isolation ◽  
Optimization Problems ◽  
Three Dimensional ◽  
Low Frequency ◽  
Aircraft Engine ◽  
Variable Metric ◽  
Design Variables ◽  
Engine Mount ◽  
Optimization Search

Abstract Design optimization of aircraft engine-mount systems for vibration isolation is presented. The engine is modeled as a rigid body connected to a flexible base representing the nacelle. The base is modeled with mass and stiffness matrices and structural damping using finite element modeling. The mounts are modeled as three-dimensional springs with hysteresis damping. The objective is to select the stiffness coefficients and orientation angles of the individual mounts to minimize the transmitted forces from the engine to the base. Meanwhile, the mounts have to be stiff enough not allowing engine deflection to exceed its limits under static and low frequency loadings. It is shown that with an optimal system the transmitted forces may be reduced significantly particularly when mount orientation angles are also treated as design variables. The optimization problems are solved using a Constraint Variable Metric approach. The closed form derivatives of the engine vibrational amplitudes with respect to design variables are derived in order to achieve a more effective optimization search technique.

scholarly journals Differential Evolution with Novel Mutation and Adaptive Crossover Strategies for Solving Large Scale Global Optimization Problems

2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
Ali Wagdy Mohamed ◽  
Abdulaziz S. Almazyad
Keyword(s):  
Global Optimization ◽  
Differential Evolution ◽  
Large Scale ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
High Dimensional ◽  
Gradual Change ◽  
Comparison Results ◽  
Mutation Strategy ◽  
Common Trade

This paper presents Differential Evolution algorithm for solving high-dimensional optimization problems over continuous space. The proposed algorithm, namely, ANDE, introduces a new triangular mutation rule based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vectors between the best, better, and the worst individuals among the three randomly selected vectors. The mutation rule is combined with the basic mutation strategy DE/rand/1/bin, where the new triangular mutation rule is applied with the probability of 2/3 since it has both exploration ability and exploitation tendency. Furthermore, we propose a novel self-adaptive scheme for gradual change of the values of the crossover rate that can excellently benefit from the past experience of the individuals in the search space during evolution process which in turn can considerably balance the common trade-off between the population diversity and convergence speed. The proposed algorithm has been evaluated on the 20 standard high-dimensional benchmark numerical optimization problems for the IEEE CEC-2010 Special Session and Competition on Large Scale Global Optimization. The comparison results between ANDE and its versions and the other seven state-of-the-art evolutionary algorithms that were all tested on this test suite indicate that the proposed algorithm and its two versions are highly competitive algorithms for solving large scale global optimization problems.

scholarly journals Multiscale Cooperative Differential Evolution Algorithm

2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Yongzhao Du ◽  
Yuling Fan ◽  
Xiaofang Liu ◽  
Yanmin Luo ◽  
Jianeng Tang ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Early Stage ◽  
Differential Evolution Algorithm ◽  
Search Range ◽  
Adaptive Parameter ◽  
Mutation Strategy ◽  
Evolution Algorithm ◽  
Evolution Algorithms ◽  
The Individual

A multiscale cooperative differential evolution algorithm is proposed to solve the problems of narrow search range at the early stage and slow convergence at the later stage in the performance of the traditional differential evolution algorithms. Firstly, the population structure of multipopulation mechanism is adopted so that each subpopulation is combined with a corresponding mutation strategy to ensure the individual diversity during evolution. Then, the covariance learning among populations is developed to establish a suitable rotating coordinate system for cross operation. Meanwhile, an adaptive parameter adjustment strategy is introduced to balance the population survey and convergence. Finally, the proposed algorithm is tested on the CEC 2005 benchmark function and compared with other state-of-the-art evolutionary algorithms. The experiment results showed that the proposed algorithm has better performance in solving global optimization problems than other compared algorithms.

Sign in / Sign up

Export Citation Format

Share Document