In this paper, the problem of optimally approximating linear systems is solved by a differential evolution algorithm (DEA) incorporating a search-space expansion scheme. The optimal approximate rational model with/wit...
详细信息
In this paper, the problem of optimally approximating linear systems is solved by a differential evolution algorithm (DEA) incorporating a search-space expansion scheme. The optimal approximate rational model with/without a time delay for a system described by its rational or irrational transfer function is sought such that a frequency-domain L-2-error criterion is minimized. The distinct feature of the proposed model approximation approach is that the search-space expansion scheme can enhance the possibility of converging to a global optimum in the DE search. This feature and the chosen frequency-domain error criterion make the proposed approach quite efficacious for optimally approximating unstable and/or nonmimimum-phase linear systems. The simplicity and robustness of the modified DEA in terms of easy implementation and minimum assumptions on search space are demonstrated by two numerical examples.
Assessing and estimating essential parameters for a metabolic pathway by using a mathematical model is a significant step in Systems Biology. However, estimating process often faces numerous obstacles, for example whe...
详细信息
Assessing and estimating essential parameters for a metabolic pathway by using a mathematical model is a significant step in Systems Biology. However, estimating process often faces numerous obstacles, for example when the number of unknown parameters escalates or data has noise, gets trapped in local minima and or having repeated exploration of poor solution during search process. Thus, this study proposes an improved Bee Memory differential evolution algorithm (IBMDE), which is a combination of the differential evolution algorithm (DE), the Kalman Filter (KF), the Artificial Bee Colony algorithm (ABC), and a memory feature to solve the aforementioned problems. The implemented metabolic pathways for this improved estimation algorithm were glycerol and pyruvate synthesis pathways. IBMDE was successful in generating the estimated optimal kinetic parameter values with noticeable reduction in errors (81.36% and 99.46% respectively) and faster convergence times (6.19% and 15.72% respectively) compared to DE, the Genetic algorithm (GA), the Nelder Mead (NM), and the Simulated Annealing (SA). The results indicated that, most importantly, the kinetic parameters produced by IBMDE had enhanced the production of desired metabolites than the other estimation algorithms. Besides that, the results also demonstrated the reliability of IBMDE as an estimation algorithm in terms of lower error.
In this paper a new method for recognition of 2D occluded shapes based on neural networks using generalized differentialevolution training algorithm is proposed. Firstly, a generalization strategy of differential evo...
详细信息
In this paper a new method for recognition of 2D occluded shapes based on neural networks using generalized differentialevolution training algorithm is proposed. Firstly, a generalization strategy of differential evolution algorithm is introduced. And this global optimization algorithm is applied to train the multilayer perceptron neural networks. The proposed algorithms are evaluated through a plant species identification task involving 25 plant species. For this practical problem, a multiscale Fourier descriptors (MFDs) method is applied to the plant images to extract shape features. Finally, the experimental results show that our proposed GDE training method is feasible and efficient for large-scale shape recognition problem. Moreover, the experimental results illustrated that the GDE training algorithm combined with gradient-based training algorithms will achieve better convergence performance. (c) 2006 Elsevier B.V. All rights reserved.
This study proposes a hybrid algorithm combining sequential quadratic programming (SQP) and differentialevolution (DE) algorithm for solving the optimal power flow (OPF) problem. In this hybrid method, SQP is used to...
详细信息
This study proposes a hybrid algorithm combining sequential quadratic programming (SQP) and differentialevolution (DE) algorithm for solving the optimal power flow (OPF) problem. In this hybrid method, SQP is used to generate an individual, which is a member of an initial population, for DE algorithm. Having generated an individual by SQP, which will be nearer to the optimal solution, DE algorithm can reach the optimal solution more effectively than the classical evolutionary algorithms can. The proposed method has been used to solve the OPF problem on the standard IEEE 30- and IEEE 118-bus test systems to validate the effectiveness. Two different objectives, namely fuel cost considering valve-point effects and the transmission line losses, have been considered. The simulation results obtained from the proposed hybrid method reveal that this algorithm gives better solution for the problem having more non-convexity.
Multi -modal multi -objective problems (MMOPs) have gained much attention during the last decade. These problems have two or more global or local Pareto optimal sets (PSs), some of which map to the same Pareto front (...
详细信息
Multi -modal multi -objective problems (MMOPs) have gained much attention during the last decade. These problems have two or more global or local Pareto optimal sets (PSs), some of which map to the same Pareto front (PF). This article presents a new affinity propagation clustering (APC) method based on the Multi -modal multiobjective differentialevolution (MMODE) algorithm, called MMODE_AP, for the suit of CEC'2020 benchmark functions. First, two adaptive mutation strategies are adopted to balance exploration and exploitation and improve the diversity in the evolution process. Then, the affinity propagation clustering method is adopted to define the crowding degree in decision space (DS) and objective space (OS). Meanwhile, the non -dominated sorting scheme incorporates a particular crowding distance to truncate the population during the environmental selection process, which can obtain welldistributed solutions in both DS and OS. Moreover, the local PF membership of the solution is defined, and a predefined parameter is introduced to maintain of the local PSs and solutions around the global PS. Finally, the proposed algorithm is implemented on the suit of CEC'2020 benchmark functions for comparison with some MMODE algorithms. According to the experimental study results, the proposed MMODE_AP algorithm has about 20 better performance results on benchmark functions compared to its competitors in terms of reciprocal of Pareto sets proximity (rPSP), inverted generational distances (IGD) in the decision (IGDX) and objective (IGDF). The proposed algorithm can efficiently achieve the two goals, i.e., the convergence to the true local and global Pareto fronts along with better distributed Pareto solutions on the Pareto fronts.
In real-life, green logistics is prevalent with the advent of pollution reduction;therefore, electric vehicle routing problem (EVRP) gains more focus. However, nonlinear charging technique has not obtained adequate at...
详细信息
In real-life, green logistics is prevalent with the advent of pollution reduction;therefore, electric vehicle routing problem (EVRP) gains more focus. However, nonlinear charging technique has not obtained adequate attention for EVRP with time windows. In this study, an improved differentialevolution (IDE) algorithm is introduced to address a variant of EVRP, which involves time windows and partial recharging policy with nonlinear charging. In IDE, a productive approach is developed to instruct the electric vehicle to charge in advance. A modified crossover operator is proposed to make populations more diverse. Five local neighborhood operators and a simulated annealing algorithm are embedded to enhance search quality. Further, we generate 55 instances based on Solomon benchmark and Analysis of Variance is leveraged to manifest the efficacy. Similarly, three algorithms are selected for comparison, i.e., genetic algorithm, artificial bee colony algorithm, and adaptive large neighborhood search. Experimental comparisons reveal that IDE outperforms others.
Generally, the optimization problem has different relationships (i.e., linear, approximately linear, non-linear, or highly non-linear) with different optimized variables. The choices of control parameters and mutation...
详细信息
Generally, the optimization problem has different relationships (i.e., linear, approximately linear, non-linear, or highly non-linear) with different optimized variables. The choices of control parameters and mutation strategies would directly affect the performance of differentialevolution (DE) algorithm in satisfying the evolution requirement of each optimized variable and balancing its exploitation and exploration capabilities. Therefore, a self-adaptive DE algorithm with discrete mutation control parameters (DMPSADE) is proposed. In DMPSADE, each variable of each individual has its own mutation control parameter, and each individual has its own crossover control parameter and mutation strategy. DMPSADE was compared with 8 state-of-the-art DE variants and 3 non-DE algorithms by using 25 benchmark functions. The statistical results indicate that the average performance of DMPSADE is better than those of all other competitors. (C) 2014 Elsevier Ltd. All rights reserved.
A differentialevolution (DE) algorithm for determining 16 advanced turning model parameters of a 1.2 million industrial fluid catalytic cracking (FCC) unit modeling by HYSYS 8.4 is presented. Industrial data from a C...
详细信息
A differentialevolution (DE) algorithm for determining 16 advanced turning model parameters of a 1.2 million industrial fluid catalytic cracking (FCC) unit modeling by HYSYS 8.4 is presented. Industrial data from a Chinese petroleum refinery were used to develop, train and check the model. Due to FCC complexity, the proposed model is capable of predicting the yield of products based on main operating conditions. The optimized FCC model is used for further optimized analysis of the FCC unit operating conditions based on the maximum of economic benefits. Prediction of the economic benefit of FCC unit increases 917 yuan/h at the optimized operating conditions.
In this work, a novel identification method based on differential evolution algorithm has been applied to bilinear systems and its performance has been compared to that of genetic algorithm. Box Jenkins system and dif...
详细信息
In this work, a novel identification method based on differential evolution algorithm has been applied to bilinear systems and its performance has been compared to that of genetic algorithm. Box Jenkins system and different type bilinear systems have been identified using differentialevolution and genetic algorithms. The simulation results have shown that bilinear systems can be successfully and efficiently identified using these algorithms.
In this paper, we present a new morphology-based homomorphic filtering technique for feature enhancement in medical images. The proposed method is based on decomposing an image into morphological subbands. The homomor...
详细信息
In this paper, we present a new morphology-based homomorphic filtering technique for feature enhancement in medical images. The proposed method is based on decomposing an image into morphological subbands. The homomorphic filtering is performed using the morphological subbands. The differential evolution algorithm is applied to find an optimal gain and structuring element for each subband. Simulations show that the proposed filter improves the contrast of the features in medical images.
暂无评论