Optimization of FLADE Variable Cycle Engine Performance Based on Improved Differential Evolution Algorithm

Author(s):  
Zhang Xiao-bo ◽  
Wang Zhan-xue

In this paper, a double bypass variable cycle engine with FLADE (Fan on Blade) is considered. The FLADE VCE is one of the research hotspots for future military and civil aircraft power device, which shows outstanding performance advantages. Compared to the mixed-flow turbofan, FLADE VCE is more complex than conventional aero-engine for its multi-components and multi-variable parts, which make it difficult to modeling and optimization. For getting the performance of FLADE VCE, the model for engine performance simulation is researched. The method for FLADE performance simulation and the steady-state performance simulation model for FLADE VCE are developed. And a component-based engine performance simulation system is established based on object-oriented modeling method. For obtaining the optimal integrated performance of FLADE VCE, suitable optimization method is required. Unfortunately, the optimization of FLADE VCE is a non-linear non-differentiable problem, which makes it difficult to solve by conventional deterministic optimization method. In order to solve this problem, the differential evolution (DE) algorithm is considered. To overcome the limitations of original DE algorithm, an improved DE algorithm with modifying mutation operator is proposed by this paper. The FLADE VCE optimization problem is solved by employing the improved DE algorithm.

2013 ◽  
Vol 415 ◽  
pp. 349-352
Author(s):  
Hong Wei Zhao ◽  
Hong Gang Xia

Differential evolution (DE) is a population-based stochastic function minimizer (or maximizer), whose simple yet powerful and straightforward features make it very attractive for numerical optimization. However, DE is easy to trapped into local optima. In this paper, an improved differential evolution algorithm (IDE) proposed to speed the convergence rate of DE and enhance the global search of DE. The IDE employed a new mutation operation and modified crossover operation. The former can rapidly enhance the convergence of the MDE, and the latter can prevent the MDE from being trapped into the local optimum effectively. Besides, we dynamic adjust the scaling factor (F) and the crossover rate (CR), which is aimed at further improving algorithm performance. Based on several benchmark experiment simulations, the IDE has demonstrated stronger convergence and stability than original differential (DE) algorithm and other algorithms (PSO and JADE) that reported in recent literature.


Author(s):  
Jeerayut Wetweerapong ◽  
Pikul Puphasuk

In this research, an improved differential evolution algorithm with a restart technique (DE-R) is designed for solutions of systems of nonlinear equations which often occurs in solving complex computational problems involving variables of nonlinear models. DE-R adds a new strategy for mutation operation and a restart technique to prevent premature convergence and stagnation during the evolutionary search to the basic DE algorithm. The proposed method is evaluated on various real world and synthetic problems and compared with the recently developed methods in the literature. Experiment results show that DE-R can successfully solve all the test problems with fast convergence speed and give high quality solutions. It also outperforms the compared methods.


2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Zhehuang Huang ◽  
Yidong Chen

The differential evolution (DE) algorithm is a heuristic global optimization technique based on population which is easy to understand, simple to implement, reliable, and fast. The evolutionary parameters directly influence the performance of differential evolution algorithm. The adjustment of control parameters is a global behavior and has no general research theory to control the parameters in the evolution process at present. In this paper, we propose an adaptive parameter adjustment method which can dynamically adjust control parameters according to the evolution stage. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and faster convergence speed.


2018 ◽  
Vol 23 (4) ◽  
pp. 79 ◽  
Author(s):  
Poontana Sresracoo ◽  
Nuchsara Kriengkorakot ◽  
Preecha Kriengkorakot ◽  
Krit Chantarasamai

The objective of this research is to develop metaheuristic methods by using the differential evolution (DE) algorithm for solving the U-shaped assembly line balancing problem Type 1 (UALBP-1). The proposed DE algorithm is applied for balancing the lines (manufacturing a single product within a fixed given cycle time), where the aim is to minimize the number of workstations. After establishing the method, the results from previous research studies were compared with the results from this study. For the UALBP, two groups of benchmark problems were used for the experiments: (1) For the medium-sized UALBP (21–45 tasks), it was found that the DE algorithm DE/best/2 to Exponential Crossover 1 produced better solutions when compared to the other metaheuristic methods: it could generate 25 optimal solutions from a total of 25 instances, and the average time used for the calculation was 0.10 seconds/instance; (2) for the large-scale UALBP (75–297 tasks), it was found that the basic DE algorithm and improved differential evolution algorithm generated better solutions, and DE/best/2 to Exponential Crossover 1 generated the optimal solutions and achieved the minimum solution search time when compared to the other metaheuristic methods: it could generate 36 optimal solutions from a total of 62 instances, and the average time used for the calculation was 4.88 seconds/instance. From the comparison of the DE algorithms, it was found that the improved differential evolution algorithm generated optimal solutions with a better solution search time than the search time of the basic differential evolution algorithm. The basic and improved DE algorithm are the effective methods for balancing UALBP-1 when compared to the other metaheuristic methods.


Author(s):  
Haiqing Liu ◽  
Jinmeng Qu ◽  
Yuancheng Li

Background: As more and more renewable energy such as wind energy is connected to the power grid, the static economic dispatch in the past cannot meet its needs, so the dynamic economic dispatch of the power grid is imperative. Methods: Hence, in this paper, we proposed an Improved Differential Evolution algorithm (IDE) based on Differential Evolution algorithm (DE) and Artificial Bee Colony algorithm (ABC). Firstly, establish the dynamic economic dispatch model of wind integrated power system, in which we consider the power balance constraints as well as the generation limits of thermal units and wind farm. The minimum power generation costs are taken as the objectives of the model and the wind speed is considered to obey the Weibull distribution. After sampling from the probability distribution, the wind speed sample is converted into wind power. Secondly, we proposed the IDE algorithm which adds the local search and global search thoughts of ABC algorithm. The algorithm provides more local search opportunities for individuals with better evolution performance according to the thought of artificial bee colony algorithm to reduce the population size and improve the search performance. Results: Finally, simulations are performed by the IEEE-30 bus example containing 6 generations. By comparing the IDE with the other optimization model like ABC, DE, Particle Swarm Optimization (PSO), the experimental results show that obtained optimal objective function value and power loss are smaller than the other algorithms while the time-consuming difference is minor. The validity of the proposed method and model is also demonstrated. Conclusion: The validity of the proposed method and the proposed dispatch model is also demonstrated. The paper also provides a reference for economic dispatch integrated with wind power at the same time.


Sign in / Sign up

Export Citation Format

Share Document