• Title/Summary/Keyword: differential evolution (DE)

Search Result 73, Processing Time 0.025 seconds

Special Protection and Control Scheme for Transmission Line Overloading Elimination Based on Hybrid Differential Evolution/Electromagnetism-Like Algorithm

  • Hadi, Mahmood Khalid;Othman, Mohammad Lutfi;Wahab, Noor Izzri Abd
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.1729-1742
    • /
    • 2017
  • In designing System Protection Schemes (SPSs) in power systems, protecting transmission network against extreme undesired conditions becomes a significant challenge in mitigating the transmission line overloading. This paper presents an intelligent Special Protection and Control Scheme (SPCS) using of Differential Evolution with Adaptive Mutation (DEAM) approach to obtain the optimum generation rescheduling to solve the transmission line overloading problem in system contingency conditions. DEAM algorithm employs the attraction-repulsion idea that is applied in the electromagnetism-like algorithm to support the mutation process of the conventional Differential Evolution (DE) algorithm. Different N-1 contingency conditions under base and increase load demand are considered in this paper. Simulation results have been compared with those acquired from Genetic Algorithm (GA) application. Minimum severity index has been considered as the objective function. The final results show that the presented DEAM method offers better performance than GA in terms of faster convergence and less generation fuel cost. IEEE 30-bus test system has been used to prove the effectiveness and robustness of the proposed algorithm.

Structural health monitoring through meta-heuristics - comparative performance study

  • Pholdee, Nantiwat;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.1 no.4
    • /
    • pp.315-327
    • /
    • 2016
  • Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

Global Optimization Using Kriging Metamodel and DE algorithm (크리깅 메타모델과 미분진화 알고리듬을 이용한 전역최적설계)

  • Lee, Chang-Jin;Jung, Jae-Jun;Lee, Kwang-Ki;Lee, Tae-Hee
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.537-542
    • /
    • 2001
  • In recent engineering, the designer has become more and more dependent on computer simulation. But defining exact model using computer simulation is too expensive and time consuming in the complicate systems. Thus, designers often use approximation models, which express the relation between design variables and response variables. These models are called metamodel. In this paper, we introduce one of the metamodel, named Kriging. This model employs an interpolation scheme and is developed in the fields of spatial statistics and geostatistics. This class of interpolating model has flexibility to model response data with multiple local extreme. By reason of this multi modality, we can't use any gradient-based optimization algorithm to find global extreme value of this model. Thus we have to introduce global optimization algorithm. To do this, we introduce DE(Differential Evolution). DE algorithm is developed by Ken Price and Rainer Storn, and it has recently proven to be an efficient method for optimizing real-valued multi-modal objective functions. This algorithm is similar to GA(Genetic Algorithm) in populating points, crossing over, and mutating. But it introduces vector concept in populating process. So it is very simple and easy to use. Finally, we show how we determine Kriging metamodel and find global extreme value through two mathematical examples.

  • PDF

ACDE2: An Adaptive Cauchy Differential Evolution Algorithm with Improved Convergence Speed (ACDE2: 수렴 속도가 향상된 적응적 코시 분포 차분 진화 알고리즘)

  • Choi, Tae Jong;Ahn, Chang Wook
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1090-1098
    • /
    • 2014
  • In this paper, an improved ACDE (Adaptive Cauchy Differential Evolution) algorithm with faster convergence speed, called ACDE2, is suggested. The baseline ACDE algorithm uses a "DE/rand/1" mutation strategy to provide good population diversity, and it is appropriate for solving multimodal optimization problems. However, the convergence speed of the mutation strategy is slow, and it is therefore not suitable for solving unimodal optimization problems. The ACDE2 algorithm uses a "DE/current-to-best/1" mutation strategy in order to provide a fast convergence speed, where a control parameter initialization operator is used to avoid converging to local optimization. The operator is executed after every predefined number of generations or when every individual fails to evolve, which assigns a value with a high level of exploration property to the control parameter of each individual, providing additional population diversity. Our experimental results show that the ACDE2 algorithm performs better than some state-of-the-art DE algorithms, particularly in unimodal optimization problems.

Differential Evolution Based Clustering (차분진화에 기초한 클러스터링)

  • Ham, Seo-Hyun;Lee, Hyun-Chang;Shin, Seong-Yoon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.07a
    • /
    • pp.389-390
    • /
    • 2019
  • Tensor decomposition, proven to be an efficient data processing method, can be used to provide data-driven services. we propose a novel datadriven mutation strategy for parent individuals selection, namely tensor-based DE with parapatric and cross-generation(TPCDE).

  • PDF

Ecological Based Hybrid Differential Evolution (생태 기반 하이브리드 차등 진화)

  • Shin, Seong-Yoon;Cho, Gwang-Hyun;Cho, Seung-Pyo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.416-417
    • /
    • 2022
  • In this paper, we propose a hybrid DE based on an ecological model algorithm called SparkHDE-EM. This model implements the parallelization of various DE variants by introducing an island model based on Spark, and utilizes the Monod model to maintain a balance between resources.

  • PDF

Differential Evolution Approach for Performance Enhancement of Field-Oriented PMSMs

  • Yun, Hong Min;Kim, Yong;Choi, Han Ho
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2301-2309
    • /
    • 2018
  • In a field-oriented vector-controlled permanent magnet synchronous motor (PMSM) control system, the d-axis current control loop can offer a free degree of freedom which can be used to improve control performances. However, in the industry the desired d-axis current command is usually set as zero without using the free degree of freedom. This paper proposes a method to use the degree of freedom for control performance improvement. It is assumed that both the inner loop proportional-integral (PI) current controller and the q-axis outer loop PI speed controller are tuned by the well-known tuning rules. This paper gives an optimal d-axis reference current command generator such that some useful performance indexes are minimized and/or a tradeoff between conflicting performance criteria is made. This paper uses a differential evolution algorithm to autotune the parameter values of the optimal d-axis reference current command generator. This paper implements the proposed control system in real time on a Texas Instruments TMS320F28335 floating-point DSP. This paper also gives experimental results showing the practicality and feasibility of the proposed control system, along with simulation results.

Pilot Symbol Assisted Weighted Data Fusion Scheme for Uplink Base-Station Cooperation System

  • Zhang, Zhe;Yang, Jing;Zhang, Jiankang;Mu, Xiaomin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.528-544
    • /
    • 2015
  • Base Station Cooperation (BSC) has been a promising technique for combating the Inter-Cell Interference (ICI) by exchanging information through a high-speed optical fiber back-haul to increase the diversity gain. In this paper, we propose a novel pilot symbol assisted data fusion scheme for distributed Uplink BSC (UBSC) based on Differential Evolution (DE) algorithm. Furthermore, the proposed scheme exploits the pre-defined pilot symbols as the sample of transmitted symbols to constitute a sub-optimal Weight Calculation (WC) model. To circumvent the non-linear programming problem of the proposed sub-optimal model, DE algorithm is employed for searching the proper fusion weights. Compared with the existing equal weights based soft combining scheme, the proposed scheme can adaptively adjust the fusion weights according to the accuracy of cooperative information, which remains the relatively low computational complexity and back-haul traffic. Performance analysis and simulation results show that, the proposed scheme can significantly improve the system performance with the pilot settings of the existing standards.

An Evolutionary Optimized Algorithm Approach to Compensate the Non-linearity in Linear Variable Displacement Transducer Characteristics

  • Murugan, S.;Umayal, S.P.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.2142-2153
    • /
    • 2014
  • Linearization of transducer characteristic plays a vital role in electronic instrumentation because all transducers have outputs nonlinearly related to the physical variables they sense. If the transducer output is nonlinear, it will produce a whole assortment of problems. Transducers rarely possess a perfectly linear transfer characteristic, but always have some degree of non-linearity over their range of operation. Attempts have been made by many researchers to increase the range of linearity of transducers. This paper presents a method to compensate nonlinearity of Linear Variable Displacement Transducer (LVDT) based on Extreme Learning Machine (ELM) method, Differential Evolution (DE) algorithm and Artificial Neural Network (ANN) trained by Genetic Algorithm (GA). Because of the mechanism structure, LVDT often exhibit inherent nonlinear input-output characteristics. The best approximation capability of optimized ANN technique is beneficial to this. The use of this proposed method is demonstrated through computer simulation with the experimental data of two different LVDTs. The results reveal that the proposed method compensated the presence of nonlinearity in the displacement transducer with very low training time, lowest Mean Square Error (MSE) value and better linearity. This research work involves less computational complexity and it behaves a good performance for nonlinearity compensation for LVDT and has good application prospect.