• Title/Summary/Keyword: differential evolution algorithm

Search Result 116, Processing Time 0.023 seconds

Multi-layered Ground Back Analysis of Retaining Wall Using Differential Evolution Algorithm : Basic Research of Digital Twin (차분진화 알고리즘을 이용한 흙막이 벽체의 다층지반 역해석 : 디지털 트윈 기초연구)

  • Lee, Donggun;Kang, Kyungnam;Song, Kiil
    • Journal of the Korean GEO-environmental Society
    • /
    • v.23 no.1
    • /
    • pp.25-30
    • /
    • 2022
  • It is very important to investigate the ground properties of a construction site for the stability during the construction of the retaining wall. In the retaining wall construction stage, ground properties are checked through ground investigation, but the actual ground properties may be different from the ground investigation result. In order to analyze the stability of the retaining wall in real time, it is important to reflect the properties of the actual ground. Also, when it is judged that the wall is unstable, an appropriate solution must be provided for the stability of the wall. This study aims to present a technique for predicting the actual ground properties through a differential evolution algorithm and judging the stability of the earth wall in real time through the digital twin of the retaining wall.

The Multi-step Adomian Decomposition Method for Approximating a Fractional Smoking Habit Model

  • Zuriqat, Mohammad;Freihat, Asad
    • Kyungpook Mathematical Journal
    • /
    • v.60 no.4
    • /
    • pp.753-765
    • /
    • 2020
  • Smoking is one of the main causes of health problems and continues to be one of the world's most significant health challenges. In this paper, we use the multi-step Adomian decomposition method (MSADM) to obtain approximate analytical solutions for a mathematical fractional model of the evolution of the smoking habit. The proposed MSADM scheme is only a simple modification of the Adomian decomposition method (ADM), in which ADM is treated algorithmically with a sequence of small intervals (i.e. time step) for finding accurate approximate solutions to the corresponding problems. A comparative study between the new algorithm and the classical Runge-Kutta method is presented in the case of integer-order derivatives. The solutions obtained are also presented graphically. The results reveal that the method is effective and convenient for solving linear and nonlinear differential equations of fractional order.

Image Denoising Based on Adaptive Fractional Order Anisotropic Diffusion

  • Yu, Jimin;Tan, Lijian;Zhou, Shangbo;Wang, Liping;Wang, Chaomei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.436-450
    • /
    • 2017
  • Recently, the method based on fractional order partial differential equation has been used in image processing. Usually, the optional order of fractional differentiation is determined by a lot of experiments. In this paper, a denoising model is proposed based on adaptive fractional order anisotropic diffusion. In the proposed model, the complexity of the local image texture is reflected by the local variance, and the order of the fractional differentiation is determined adaptively. In the process of the adaptive fractional order model, the discrete Fourier transform is applied to compute the fractional order difference as well as the dynamic evolution process. Experimental results show that the peak signal-to-noise ratio (PSNR) and structural similarity index measurement (SSIM) of the proposed image denoising algorithm is better than that of other some algorithms. The proposed algorithm not only can keep the detailed image information and edge information, but also obtain a good visual effect.

Optimal fin planting of splayed multiple cross-sectional pin fin heat sinks using a strength pareto evolutionary algorithm 2

  • Ramphueiphad, Sanchai;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.6 no.1
    • /
    • pp.31-42
    • /
    • 2021
  • This research aims to demonstrate the optimal geometrical design of splayed multiple cross-sectional pin fin heat sinks (SMCSPFHS), which are a type of side-inlet-side-outlet heat sink (SISOHS). The optimiser strength Pareto evolutionary algorithm2 (SPEA2)is employed to explore a set of Pareto optimalsolutions. Objective functions are the fan pumping power and junction temperature. Function evaluations can be accomplished using computational fluid dynamics(CFD) analysis. Design variablesinclude pin cross-sectional areas, the number of fins, fin pitch, thickness of heatsink base, inlet air speed, fin heights, and fin orientations with respect to the base. Design constraints are defined in such a way as to make a heat sink usable and easy to manufacture. The optimum results obtained from SPEA2 are compared with the straight pin fin design results obtained from hybrid population-based incremental learning and differential evolution (PBIL-DE), SPEA2, and an unrestricted population size evolutionary multiobjective optimisation algorithm (UPSEMOA). The results indicate that the splayed pin-fin design using SPEA2 issuperiorto those reported in the literature.

Bargaining Game using Artificial agent based on Evolution Computation (진화계산 기반 인공에이전트를 이용한 교섭게임)

  • Seong, Myoung-Ho;Lee, Sang-Yong
    • Journal of Digital Convergence
    • /
    • v.14 no.8
    • /
    • pp.293-303
    • /
    • 2016
  • Analysis of bargaining games utilizing evolutionary computation in recent years has dealt with important issues in the field of game theory. In this paper, we investigated interaction and coevolution process among heterogeneous artificial agents using evolutionary computation in the bargaining game. We present three kinds of evolving-strategic agents participating in the bargaining games; genetic algorithms (GA), particle swarm optimization (PSO) and differential evolution (DE). The co-evolutionary processes among three kinds of artificial agents which are GA-agent, PSO-agent, and DE-agent are tested to observe which EC-agent shows the best performance in the bargaining game. The simulation results show that a PSO-agent is better than a GA-agent and a DE-agent, and that a GA-agent is better than a DE-agent with respect to co-evolution in bargaining game. In order to understand why a PSO-agent is the best among three kinds of artificial agents in the bargaining game, we observed the strategies of artificial agents after completion of game. The results indicated that the PSO-agent evolves in direction of the strategy to gain as much as possible at the risk of gaining no property upon failure of the transaction, while the GA-agent and the DE-agent evolve in direction of the strategy to accomplish the transaction regardless of the quantity.

Design of Optimized pRBFNNs-based Face Recognition Algorithm Using Two-dimensional Image and ASM Algorithm (최적 pRBFNNs 패턴분류기 기반 2차원 영상과 ASM 알고리즘을 이용한 얼굴인식 알고리즘 설계)

  • Oh, Sung-Kwun;Ma, Chang-Min;Yoo, Sung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.749-754
    • /
    • 2011
  • In this study, we propose the design of optimized pRBFNNs-based face recognition system using two-dimensional Image and ASM algorithm. usually the existing 2 dimensional face recognition methods have the effects of the scale change of the image, position variation or the backgrounds of an image. In this paper, the face region information obtained from the detected face region is used for the compensation of these defects. In this paper, we use a CCD camera to obtain a picture frame directly. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. AdaBoost algorithm is used for the detection of face image between face and non-face image area. We can butt up personal profile by extracting the both face contour and shape using ASM(Active Shape Model) and then reduce dimension of image data using PCA. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of RBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to real-time face image database and then demonstrated from viewpoint of the output performance and recognition rate.

Improving CMD Areal Density Analysis: Algorithms and Strategies

  • Wilson, R.E.
    • Journal of Astronomy and Space Sciences
    • /
    • v.31 no.2
    • /
    • pp.121-130
    • /
    • 2014
  • Essential ideas, successes, and difficulties of Areal Density Analysis (ADA) for color-magnitude diagrams (CMD's) of resolved stellar populations are examined, with explanation of various algorithms and strategies for optimal performance. A CMD-generation program computes theoretical datasets with simulated observational error and a solution program inverts the problem by the method of Differential Corrections (DC) so as to compute parameter values from observed magnitudes and colors, with standard error estimates and correlation coefficients. ADA promises not only impersonal results, but also significant saving of labor, especially where a given dataset is analyzed with several evolution models. Observational errors and multiple star systems, along with various single star characteristics and phenomena, are modeled directly via the Functional Statistics Algorithm (FSA). Unlike Monte Carlo, FSA is not dependent on a random number generator. Discussions include difficulties and overall requirements, such as need for fast evolutionary computation and realization of goals within machine memory limits. Degradation of results due to influence of pixelization on derivatives, Initial Mass Function (IMF) quantization, IMF steepness, low Areal Densities ($\mathcal{A}$), and large variation in $\mathcal{A}$ are reduced or eliminated through a variety of schemes that are explained sufficiently for general application. The Levenberg-Marquardt and MMS algorithms for improvement of solution convergence are contained within the DC program. An example of convergence, which typically is very good, is shown in tabular form. A number of theoretical and practical solution issues are discussed, as are prospects for further development.

An efficient procedure for lightweight optimal design of composite laminated beams

  • Ho-Huu, V.;Vo-Duy, T.;Duong-Gia, D.;Nguyen-Thoi, T.
    • Steel and Composite Structures
    • /
    • v.27 no.3
    • /
    • pp.297-310
    • /
    • 2018
  • A simple and efficient numerical optimization approach for the lightweight optimal design of composite laminated beams is presented in this paper. The proposed procedure is a combination between the finite element method (FEM) and a global optimization algorithm developed recently, namely Jaya. In the present procedure, the advantages of FEM and Jaya are exploited, where FEM is used to analyze the behavior of beam, and Jaya is modified and applied to solve formed optimization problems. In the optimization problems, the objective aims to minimize the overall weight of beam; and fiber volume fractions, thicknesses and fiber orientation angles of layers are selected as design variables. The constraints include the restriction on the first fundamental frequency and the boundaries of design variables. Several numerical examples with different design scenarios are executed. The influence of the design variable types and the boundary conditions of beam on the optimal results is investigated. Moreover, the performance of Jaya is compared with that of the well-known methods, viz. differential evolution (DE), genetic algorithm (GA), and particle swarm optimization (PSO). The obtained results reveal that the proposed approach is efficient and provides better solutions than those acquired by the compared methods.

3D Radar Objects Tracking and Reflectivity Profiling

  • Kim, Yong Hyun;Lee, Hansoo;Kim, Sungshin
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.263-269
    • /
    • 2012
  • The ability to characterize feature objects from radar readings is often limited by simply looking at their still frame reflectivity, differential reflectivity and differential phase data. In many cases, time-series study of these objects' reflectivity profile is required to properly characterize features objects of interest. This paper introduces a novel technique to automatically track multiple 3D radar structures in C,S-band in real-time using Doppler radar and profile their characteristic reflectivity distribution in time series. The extraction of reflectivity profile from different radar cluster structures is done in three stages: 1. static frame (zone-linkage) clustering, 2. dynamic frame (evolution-linkage) clustering and 3. characterization of clusters through time series profile of reflectivity distribution. The two clustering schemes proposed here are applied on composite multi-layers CAPPI (Constant Altitude Plan Position Indicator) radar data which covers altitude range of 0.25 to 10 km and an area spanning over hundreds of thousands $km^2$. Discrete numerical simulations show the validity of the proposed technique and that fast and accurate profiling of time series reflectivity distribution for deformable 3D radar structures is achievable.

Frequency Synchronization Algorithm for Improving Performance of OFDMA System in 3GPP LTE Downlink (3GPP LTE 하향링크 OFDMA 시스템의 수신 성능 향상을 위한 주파수 동기 알고리즘)

  • Lee, Dae-Hong;Im, Se-Bin;Roh, Hee-Jin;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.120-130
    • /
    • 2009
  • In this paper, we propose a receiver structure for frequency synchronization in OFDMA (Orthogonal Frequency Division Multiple Access) system which is considered as 3GPP LTE(Long Term Evolution) downlink. In general, OFDMA frequency synchronization consists of two parts: coarse synchronization and fine synchronization. We consider P-SCH (Primary-Synchronization Channel) and CP (Cyclic Prefix) of OFDMA symbol for coarse synchronization and fine synchronization, respectively. The P-SCH signal has two remarkable disadvantages that it does not have sufficiently many sub-carriers and its differential correlation characteristic is not good due to ZC (Zadoff Chu) sequence-specific property. Hence, conventional frequency synchronization algorithms cannot obtain satisfactory performance gain. In this paper, we propose a modified differential correlation algorithm to improve performance of the coarse frequency synchronization. Also, we introduce an effective PLL (Phase Locked Loop) structure to guarantee stable performance of the fine frequency synchronization. Simulation results verify that the proposed algorithm has superior performance to the conventional algorithms and the 2nd-order PLL is effective to track the fine frequency offset even in high mobility.