Trajectory optimization of satellite launch vehicle using Self Adaptive Differential Evolution algorithm

JADE is an state-of-the-art adaptive differential evolution algorithm which implements “DE/current-to-pbest” as its mutation strategy, adapts its mutation factor and crossover rate, and uses an optional external archive to keep track of potential removed individuals in previous generations. This paper proposes MPADE, which extends JADE by using a multi-populated approach to solve high dimensional real-parameter optimization problems. This mechanism helps preventing the two well-known problems affecting the differential evolution algorithm performance, which are premature convergence and stagnation. The algorithm was tested using the benchmark functions in IEEE Congress on Evolutionary Computation 2014 test suite. MPADE was compared using Wilcoxon test to JADE algorithm and with other state-of-the-art algorithms that either use a multi-population approach or adapt their parameters. The experimental results show that the proposed new algorithm improves significantly its precursor and it is also suggested that other state-of-the-art algorithms could benefit from the multi-populated based approach.

Multi-objective robust dynamic pricing and operation strategy optimization for integrated energy system based on stackelberg game

Differential Evolution (DE) is possibly the most current powerful stochastic real-parameter optimization algorithm and has been used in multiple diverse area such as neural networks, logistics, scheduling, modelling and others. Its simplicity, ease of implementation and reliability had captures many practitioners and scientists in implementing the algorithm. As different problems require different parameter setting, the implementation of DE in tackling complex computational optimization problem is quite challenging. Nevertheless, success of the algorithm depends on the ability to choose the right parameter setting based on problems in hand. Thus, extra attention is needed in order to fine tune the perfect parameter for each problem. Self-adaptive Differential Evolution (SADE) algorithm had been introduced in order to simplify the search for the right parameter to be used in DE algorithm. With the introduction of SADE in optimization areas, where the choice of learning strategy and parameter setting do not require predefining, parameter tuning has become less confusing. This paper aims at providing an overview on significant application that have benefited from SADE implementation. SADE had been applied in numerous disciplines such as electromagnetics, power system, computer performance, fermentation, polyester process and more. SADE has also proven to achieve better performance compared to conventional DE algorithm. By collecting and analyzing related articles that have implemented SADE in solving problem, a significant trends on the application of SADE will be provided.

Differential evolution (DE), as an extremely powerful evolutionary algorithm, has recently been widely employed within complex reality optimisation problems. However, the DE algorithm mainly focuses on strengthening the adaptability of exploitation, which allows the sensitivity of the DE algorithm to be solved in cases where the effects of solving various types of problems are quite different. Moreover, the local search ability and population diversity have not been solved properly. Therefore, an adaptive DE algorithm using fitness distance correlation and a neighbourhood-based strategy (FNADE) is proposed. FNADE introduces the fitness distance correlation (FDC) as the basis for judging the difficulty of the problem, utilises a Voronoi diagram to increase the population diversity for complex multimodal problems and adopts the neighbourhood-based mutation strategy to strengthen the local search capability. FNADE is committed to solving unconstrained single-objective optimisation problems. The proposed algorithm is compared with six advanced DE algorithms in terms of CEC2017 benchmark functions. The experimental results show that the adaptive DE algorithm using FNADE is superior to other DE algorithms with regard to the accuracy and population diversity of the solution.

Design of non-uniform linear antenna arrays is one of the most important electromagnetic optimization problems of current interest. In this article, an adaptive Differential Evolution (DE) algorithm has been used to optimize the spacing between the elements of the linear array to produce a radiation pattern with minimum side lobe level and null placement control. DE is arguably one of the best real parameter optimizers of current interest takes very few control parameters and is easy to implement in any programming language. In this study two very simple adaptation schemes are used to regulate the control parameters F and Cr, upon which the performance of DE is critically dependent. The adaptation schemes are based on the objective function values of the target vectors and donor vectors. The adaptive DE-variant has been used to solve three difficult instances of the design problem and the optimization goal in each example is easily achieved. The results of the proposed algorithm have been shown to meet or beat the recently published results obtained using other state-of-the-art metaheuristics like the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Memetic Algorithms (MA), and Tabu Search (TS) in a statistically meaningful way.

This paper presents a methodology based on Differential Evolution (DE) algorithm to perform trajectory optimization for generating reference trajectory of a four-stage Satellite Launch Vehicle (SLV). For the generation of reference trajectory, suitable objective function has been formulated incorporating parameters and the contribution of these parameters in developing the objective function has been represented by assigning different weighting factors against the different parameters. Moreover, optimal selection of the setting of parameters has also been achieved by proper optimization of the weighting factors. Finally, a comparative study has been presented between the proposed DE based design and the existing GA based design.

An effective coordination in an interconnected system can be obtained by ensuring proper settings of overcurrent relays. In this research work, the problem of coordinating the overcurrent relays is formulated as a non‐linear problem, taking into account the as discrete nature of time dial settings and the pickup current settings. An effective approach based on adaptive differential evolution (ADE) algorithm is proposed to solve the coordination problem. The results obtained by ADE are compared with different algorithms on different model test systems and found to be feasible, robust and efficient.

Variety of real-world optimization problems can be successfully solved by employing a powerful technique, called Differential Evolution (DE) algorithm. The popularity of DE has grown tremendously since its inception as it includes a very few number of control parameters. However, the selection or tuning of these parameters plays a crucial role in determining the performance of the algorithm in terms of its convergence behaviour. In this paper, a novel Self-Adaptive DE (SADE) approach has been proposed for the de sign of a multiplier-less low-pass linear-phase FIR filter to improve the computational efficiency of the algorithm. For this purpose, the convergence behaviour of the SADE technique has been presented and it has been compared with that of traditional DE technique. Additionally, the performance of the SADE-optimized filter has been evaluated in terms of its magnitude response. The corresponding magnitude response for the DE-optimized filter has also been presented for comparison. It has been established that the proposed SADE algorithm outperforms the traditional DEfor this particular design problem.

In this paper, a new adaptive grouping differential evolution (AGDE) algorithm is proposed to improve the optimization performance by implementing a prediction strategy of the constraints for constrained optimization problems. It is unnecessary to calculate the constraint values when dealing with the constraints in this method. The constraints are handled after a simple prediction according to the Lipschitz condition. When the constraints are very complex, the load arisen from the calculation of the constraint values is reduced dramatically and the feasibility of the solutions remains with great probability. In AGDE algorithm, the population is dynamically grouped to three subpopulations with respective newly-designed mutation strategy. Meanwhile, the mutation factor and crossover probability are adopted associated with the evolutionary process according to the information of the entire population. Both of the above improvements not only increase the diversity of population and speed up the convergence, but also reduce the complexity of the parameter selection. Four sets of comparative experiments are carried out to evaluate the feasibility and effectiveness of the proposed method that deals with the constraints.

In this paper, a novel Adaptive Parameter Strategy Differential Evolution (APSDE) algorithm is proposed to overcome the parameters dependence and avoid local optima. The Parameter Update Mechanism (PUM), which has three different strategies, is used to reduce the dependence on parameters of DE. The Adaptive Proportion Adjustment Mechanism (APAM) is used to balance the proportion of PUM strategies in different development terms of exploitation and exploration, and the Random Restart Mechanism (RRM) is used to improve population diversity when exploitation is in stagnation. The proposed algorithm is verified in the CEC2018 test functions and the results show that APSDE has good abilities of exploitation, exploration, convergence, and stability. Secondly, Midcourse Guidance Maneuver Decision-making (MGMD) in Beyond Visual Range (BVR) air combat is studied and transformed into a single objective variational optimization problem, a MGMD system based on APSDE is established. Finally, the simulation of MGMD is carried out. The APSDE ranks first in the typical MGMD scenario experiment. In the adaptive Midcourse guidance confrontation, the winning rate of APSDE is 54%, and the statistical results show that the APSDE has an excellent MGMD ability.

SummaryModern power systems are being shifted its attention towards distributed generations (DGs). DGs have allured more concern as an auspicious opportunity with considerable economic profits. To minimize the power generation costs of DGs, day‐to‐day operation scheduling is essential. The role of this study is to offer an optimal operation schedule for DG with several energy sources including renewable energy sources (RES), considering economic facets. In order to achieve the cost minimization along with optimal scheduling, an objection function has been formulated and solved using the optimization algorithms. This study aims to present the applications of differential evolution (DE) algorithm and its variants such as opposition‐based differential evolution (ODE), self‐adaptive differential evolution (SaDE), improved differential evolution (IDE), and cultivated differential evolution (CuDE) for scheduling DG optimally. A scheme for optimal scheduling of thermal, wind power, and solar PV generators has been evaluated. The simulations have been carried out on IEEE 14 bus system, IEEE 30 bus system, IEEE 57 bus system, and Tamil Nadu Generation and Distribution Corporation Limited (TANGEDCO), as a real part of 62 bus Indian utility system (IUS). The novelty of this study lies in simulating a real‐time system for solving optimal scheduling problem, in that way helping decision makers to choose the optimal operation points. The results indicate that the SaDE outperformed other DE variants by giving the best fitness value and convergence rate.

Q-Learning-based parameter control in differential evolution for structural optimization

A novel economic dispatch of energy-renewable multi-area power systems with group-based differential evolution

In this paper, we study the multiobjective game in a multiconflict situation. First, the feasible strategy set and synthetic strategy space are constructed in the multiconflict situation. Meanwhile, the value of payoff function under multiobjective is determined, and an integrated multiobjective game model is established in a multiconflict situation. Second, the multiobjective game model is transformed into the single-objective game model by the Entropy Weight Method. Then, in order to solve this multiobjective game, an adaptive differential evolution algorithm based on simulated annealing (ADESA) is proposed to solve this game, which is to improve the mutation factor and crossover operator of the differential evolution (DE) algorithm adaptively, and the Metropolis rule with probability mutation ability of the simulated annealing (SA) algorithm is used. Finally, the practicability and effectiveness of the algorithm are illustrated by a military example.

Aiming at the problem that the value of weighted matrix Q and R in linear quadratic optimal control (LQG) controller depends on the designer’s experience, adaptive differential evolution (JADE) algorithm with optional external archive is introduced to optimize the control parameters of LQG, so as to improve the performance of LQG controller. The dynamics model of 1/4 vehicle active suspension was established as the object, and the LQG objective function was constructed. The simulation experiments were carried out on B-class and C-class roads with the help of Matlab/Simulink.The experimental results show that the RMS values of the vertical acceleration of the vehicle body, the dynamic travel of the suspension and the dynamic displacement of the tire of the active suspension based on JADE optimized LQG controller under different road surfaces are reduced to a large extent compared with that of the passive suspension, which improves the stability of the vehicle and the comfort of the ride.