Search

Differential evolution (DE) is among the best evolutionary algorithms for global optimization. However, the basic DE has several shortcomings, like the slow convergence speed, and it is more likely to be stuck at local optima. Additionally, DE's performance is sensitive to its mutation strategies and control parameters for mutation and crossover. In this scope, we present in this paper three mechanisms to overcome DE limitations. First, two novel mutations called DE/mean-current/2 and DE/best-mean-current/2 are proposed and integrated in the DE algorithm, and they have both exploration ability and exploitation trend. On the other hand, to avoid being trapped in local minima of hard functions, a new exploration operator has been proposed called Weibull flight based on the Weibull distribution. Finally, new adapted control parameters based on the Weibull distribution are integrated. These parameters contribute to the optimization process by adjusting mutation scale and alleviating the parameter setting problem often encountered in various metaheuristics. The efficacy of the proposed algorithms called meanDE, MDEW, AMDE, and AMDEW is validated through intensive experimentations using classical tests, some challenging tests, the CEC2017, CEC2020, the most recent CEC2022, four constraint engineering problems, and the data clustering problem. Moreover, comparisons with several popular, recent, and high-performance optimization algorithms show a high effectiveness of the proposed algorithms in locating the optimal or near-optimal solutions with higher efficiency. The experiments clearly indicate the effectiveness of the new mutations compared to the standard DE mutations. Moreover, the proposed Weibull flight has a great capacity to deal with the hard composition functions of CEC benchmarks. Finally, the use of adapted control parameters for the mutation scale helps overcome the parameter setting problem commonly encountered in various metaheuristics. [ABSTRACT FROM AUTHOR]

In this paper, a multi-operator differential evolution algorithm (MODE) is proposed to solve the Optimal Power Flow problem, called MODE-OPF. The MODE-OPF utilizes the strengths of more than one differential evolution operator in a single algorithmic framework. Additionally, an adaptive method is proposed to update the number of solutions evolved by each DE operator based on both the diversity of the population and the quality of solutions. This adaptive method has the ability to maintain diversity at the early stages of the optimization process and boost convergence at the later ones. The performance of the proposed MODE-OPF is tested by solving OPF problems for both small and large IEEE bus systems (i.e., IEEE-30 and IEEE-118) while considering intermittent solar and wind power generation. To prove the suitability of this proposed algorithm, its performance has been compared against several state-of-the-art optimization algorithms, where MODE-OPF outperforms other algorithms in all experimental results thereby improving a network's performance with lower cost. MODE-OPF decreases the total generation cost up to 24.08%, the real power loss up to 6.80% and the total generation cost with emission up to 8.56%. • Development of an adaptive method (AM) for optimizing diversity and solution quality. • Innovative constraint handling approach, progressively adding constraints for improved performance. • Incorporation of intermittent renewable energy models for realistic problem solving. • Extensive validation on IEEE 30-bus and IEEE 118-bus networks, outperforming state-of-the-art algorithms in cost, loss, and environmental impact reduction. [ABSTRACT FROM AUTHOR]

The existing algorithms for solving multi-objective optimization problems fall into three main categories: Decomposition-based, dominance-based, and indicator-based. Traditional multi-objective optimization problems mainly focus on objectives, treating decision variables as a total variable to solve the problem without considering the critical role of decision variables in objective optimization. As seen, a variety of decision variable grouping algorithms have been proposed. However, these algorithms are relatively broad for the changes of most decision variables in the evolution process and are time-consuming in the process of finding the Pareto frontier. To solve these problems, a multi-objective optimization algorithm for grouping decision variables based on extreme point Pareto frontier (MOEA-DV/EPF) is proposed. This algorithm adopts a preprocessing rule to solve the Pareto optimal solution set of extreme points generated by simultaneous evolution in various target directions, obtains the basic Pareto front surface to determine the convergence effect, and analyzes the convergence and distribution effects of decision variables. In the later stages of algorithm optimization, different mutation strategies are adopted according to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals, thus enhancing the performance of the algorithm. Evaluation validation of the test functions shows that this algorithm can solve the multi-objective optimization problem more efficiently. [ABSTRACT FROM AUTHOR]

Defining inter-well connectivity is very important for the water injection development of carbonate fractured-vuggy reservoirs. However, most conventional methods based on logging or seismic data are subjective. In this research, multi-attribute seismic data were used to characterize the 3D search space, and an improved reward function was designed based on the law of fluid flow and appropriate heuristics. A deep reinforcement learning model based on an improved reward function was designed to search for inter-well connected channels. Selecting the shortest channel length and the largest flow volume were the optimization objectives. We propose the multi-objective evolutionary optimization algorithm with decomposition and differential evolution (MOEA/D-DE) based on an improved mutation operator to automatically obtain the optimal inter-well connected channels. The searched channels can readily show the spatial distribution of multi-scale fractures and caves. The experimental results of the Tahe oilfield show that the improved algorithm effectively enhanced the local convergence performance of the multi-objective algorithm and that the automatic search paths were consistent with the characteristics of seismic static data and tracer test results. Our model can better reflect the spatial distribution of a fracture cavity at different scales and offers important guidance for on-site development adjustment work in the water injection development stage. • This paper proposes a multi-target search strategy based on DRL. • It designs a new reward function to improve the algorithm search efficiency. • It constructs a new mutation strategy by designing an improved differential mutation operator. • It takes a typical well group of a unit in Tahe oilfield as the object of the experiment. [ABSTRACT FROM AUTHOR]

The linear prediction evolution algorithm (LPE) is a recent addition in the field of optimization algorithm with few parameters and high exploration capability. LPE has shown excellent results in some real-world problems but still suffers from some issues such as slow convergence speed. To improve the performance of the LPE algorithm, this study presents an improved linear prediction evolution algorithm (ILPE) to enhance its exploration capability. The proposed ILPE algorithm treats the population series of evolutionary algorithms as a time series and uses the nonlinear least square fitting model as a reproduction operator to forecast the next generation. The performance of the proposed ILPE is verified using the CEC2014 and CEC2017 benchmark functions. The comparison results show that ILPE outperforms LPE, and it is highly competitive with other state-of-the-art optimization algorithms. [ABSTRACT FROM AUTHOR]

In modern power systems, there is a greater penetration of renewable sources, resulting in the expansion of microgrid. By implementing RES instead of conventional synchronous machines, the system's overall inertia is significantly reduced. Modern and future power systems must reduce system inertia and keep the frequency at its nominal value since frequency oscillation impacts on the functionality, stability, and resilience of the system. Therefore, creating a stable, scalable, and reliable virtual inertia control system is crucial to effectively minimize the deviations during significant contingencies. Consequently, taking into account the probable issues, the foremost objective of this research work is to improve the dynamic security of an island microgrid through the implementation of a frequency control concept based on virtual inertia control. In the research study, the proposed microgrid system comprises of photovoltaics, wind-generating units, thermal power units, storage units, electric vehicles (EVs), and loads. A cascaded PIDFN controller is optimally designed using a novel metaheuristic modified differential evolution (MDE) algorithm that regulates the frequency based on virtual inertia control. In the MATLAB®/SIMULINK environment, various operating situations such as load variations, RES, and EVs disconnection are investigated, and the performance of the VIC-based MDE controller was compared to that of other controllers based on evolutionary optimization algorithms such as DE and TLBO. The results validate that the recommended virtual inertia control strategy enhances the reliability of the system. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is one of the best evolutionary algorithms (EAs). In recent decades, many techniques have been developed to enhance the performance of this algorithm, such as the Improve Self-Adaptive Differential Evolution (ISADE) algorithm. Based on the analysis of the aspects that may improve the performance of ISADE, we proposed a modified ISADE version with applying the Gauss distribution for mutation procedure. In ISADE, to determine the scaling factor (F), the population is ranked, then, based on the rank number, population size, and current generation, the formula of the Sigmoid function is used. In the proposed algorithm, F is amplified by a factor which is generated based on Gaussian distribution. It has the potential to enhance the variety of population. In comparison with several reference algorithms regarding converging speed and the consistency of optimal solutions, the simulation results reveal the performance of the suggested algorithm is exceptional. [ABSTRACT FROM AUTHOR]

This work presents an automated design methodology for time-mode proportional and integral (PI) controllers aimed for an on-chip switched-capacitor (SC) dc/dc converter system. The basis of this design is the use of evolutionary optimization algorithms to find the near-optimal set of sizings for the time-mode PI controller. It is motivated due to the difficulty faced when tuning the controller parameters at a circuit level, which arise as a result of the presence of modeling inaccuracies and the small region for the linearized model where it is defined. Moreover, this design proposes the required modifications for the original design presented for the inductor-based dc/dc converter. These modifications are necessary to operate the SC dc/dc converter in slow switching limit (SSL). The addition of a pulse-width-modulated (PWM)-to-pulse frequency-modulated (PFM) conversion block is presented and elaborated in this article. The controller is codesigned using the differential evolution algorithm for the circuit level implementation to mitigate the issues prior mentioned. The optimized controller is then tested in a simulation environment using TSMC $0.18~\mu \text{m}$ technology. The results of the optimized controller were superior to those of a conventional controller. The optimized system achieved an overall efficiency of 79.1%. [ABSTRACT FROM AUTHOR]