• Title/Summary/Keyword: evolution optimization

Search Result 401, Processing Time 0.028 seconds

Development of a Naval Vessel Compartment Arrangement Application using Differential Evolution Algorithm (Differential evolution 알고리즘을 이용한 생존성 기반의 함정 격실배치 애플리케이션 개발)

  • Kim, Youngmin;Jeong, Yong-Kuk;Ju, SuHeon;Shin, Jong-Gye;Shin, Jung-Hack
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.4
    • /
    • pp.410-422
    • /
    • 2014
  • Unlike other weapon systems, a naval vessel has unique characteristics in that the vessel itself is a naval unit. In limited space, compartments with various objectives and characteristics need to be arranged, so that vessel performance is maximized. This paper studied a compartment arrangement algorithm that considers activity relationships among compartments and survivability of a vessel. Based on the study, a compartment arrangement application is developed that can generate various layout alternatives swiftly. The application developed in this study aims at automating a two dimensional compartment layout problem. A combinatorial optimization is performed with the differential evolution algorithm to achieve the optimized layout.

Co-Evolution Algorithm for Solving Multi-Objective Optimization Problem

  • Kim, Ji-Youn;Lee, Dong-Wook;Sim, Kwee-Bo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.93.3-93
    • /
    • 2002
  • $\textbullet$ Co-evolutionary algorithms $\textbullet$ Nash Genetic Algorithms $\textbullet$ Multi-objective Optimization $\textbullet$ Distance dependent mutation $\textbullet$ Pareto Optimality

  • PDF

Optimal Design of Electropermanent Magnetic Lifter (영전식 Magnetic Lifter의 최적 설계)

  • 천장성;정현교;최승덕;양충진
    • Journal of the Korean Magnetics Society
    • /
    • v.6 no.1
    • /
    • pp.40-47
    • /
    • 1996
  • In this paper, the optimal design rrethod of the electropermanent magnetic lifter is proposed. The electromag-netic performances at the states of attraction and release are calculated by the means of the equivalent magnetic circuit rrethod. The magnetic flux flow, the magneto-rrntive force and the aJronnt of lifting force correspond to the electromagnetic performances. As the optimization algorithm, the evolution strategy(ES) is applied for the maximization of the electromagnetic force at the state of attraction and for the minimization of the volume within the alJowable electomagnetic force range.[3] At this rrnrrent, the optimization satisfy the minimization of the electromagnetic force at the state of release. The validity of the proposed optimization rrethod is verified by the comparison between the optimization result and the FEM result (this FEM result is obtained from MAXWELL).

  • PDF

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

Optimization of Design Variables of Suspension for Train using Neural Network Model (신경회로망 모델을 이용한 철도 현가장치 설계변수 최적화)

  • 김영국;박찬경;황희수;박태원
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.1086-1092
    • /
    • 2002
  • Computer simulation is essential to design the suspension elements of railway vehicle. By computer simulation, engineers can assess the feasibility of a given design factors and change them to get a better design. But if one wishes to perform complex analysis on the simulation, such as railway vehicle dynamic, the computational time can become overwhelming. Therefore, many researchers have used a mega model that has a regression model made by sampling data through simulation. In this paper, the neural network is used a mega model that have twenty-nine design variables and forty-six responses. After this mega model is constructed, multi-objective optimal solutions are achieved by using the differential evolution. This paper shows that this optimization method using the neural network and the differential evolution is a very efficient tool to solve the complex optimization problem.

  • PDF

Hybrid Optimization Method for the Reconstruction of Apodized Chirped Fiber Bragg Gratings (무족화 첩 광섬유 격자 재구성을 위한 혼합 최적화 방법)

  • Youn, Jaesoon;Im, Kiegon
    • Korean Journal of Optics and Photonics
    • /
    • v.27 no.6
    • /
    • pp.203-211
    • /
    • 2016
  • We have studied the hybrid method for reconstructing apodized chirped fiber Bragg gratings, using both an analytic estimation of grating parameters and an optimization algorithm. The Hilbert transform of the reflection spectrum was utilized to estimate grating parameters, and then the layer-peeling algorithm was used to obtain refined parameter values by the differential-evolution optimization process. Calculations for a fiber Bragg grating with wavelength chirp rate 2 nm/cm were obtained with an accuracy of $6{\times}10^{-5}nm/cm$ for the chirp rate and $3{\times}10^{-9}nm/cm$ for the index modulation, with much improved calculation speed and high reliability.

An Improved MAP-Elites Algorithm via Rotational Invariant Operator in Differential Evolution for Continuous Optimization (연속 최적화를 위한 개선된 MAP-Elites 알고리즘)

  • Tae Jong Choi
    • Smart Media Journal
    • /
    • v.13 no.2
    • /
    • pp.129-135
    • /
    • 2024
  • In this paper, we propose a new approach that enhances the continuous optimization performance of the MAP-Elites algorithm. The existing self-referencing MAP-Elites algorithm employed the "DE/rand/1/bin" operator from the differential evolution algorithm, which, due to its lack of rotational invariance, led to a degradation in optimization performance when there were high correlations among variables. The proposed algorithm replaces the "DE/rand/1/bin" operator with the "DE/current-to-rand/1" operator. This operator, possessing rotational invariance, ensures robust performance even in cases where there are high correlations among variables. Experimental results confirm that the proposed algorithm performs better than the comparison algorithms.

A Study on Performance Improvement of Evolutionary Algorithms Using Reinforcement Learning (강화학습을 이용한 진화 알고리즘의 성능개선에 대한 연구)

  • 이상환;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.420-426
    • /
    • 1998
  • Evolutionary algorithms are probabilistic optimization algorithms based on the model of natural evolution. Recently the efforts to improve the performance of evolutionary algorithms have been made extensively. In this paper, we introduce the research for improving the convergence rate and search faculty of evolution algorithms by using reinforcement learning. After providing an introduction to evolution algorithms and reinforcement learning, we present adaptive genetic algorithms, reinforcement genetic programming, and reinforcement evolution strategies which are combined with reinforcement learning. Adaptive genetic algorithms generate mutation probabilities of each locus by interacting with the environment according to reinforcement learning. Reinforcement genetic programming executes crossover and mutation operations based on reinforcement and inhibition mechanism of reinforcement learning. Reinforcement evolution strategies use the variances of fitness occurred by mutation to make the reinforcement signals which estimate and control the step length.

  • PDF

A Study on Auto-Tuning of Robust Pill using Evolution Strategy (Evolution Strategy를 이용한 강인한 PID 자동동조에 관한 연구)

  • Bae, Geun-Shin;Kim, Seong-Hoon;Lee, Young-Jin;Lee, Kwon-Soon
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1110-1112
    • /
    • 1996
  • In this paper, we propose a new approach for robust auto-tuning of PID gains using Evolution Strategy. Evolution Strategy is searching algorithm which imitate the principles of natural evolution as a method to solve parameter optimization problem and easy to use without any other special mathematical theory. Through the simulation of the speed control of a series-connected de motor, our proposed method shows more improved performance by finding optimal parameters of PID controller than a classical Ziegler-Nichols method.

  • PDF

Topology Optimization of Concrete Structures using an Evolutionary Procedure (점진적최적화기법을 이용한 콘크리트 구조물의 위상최적화)

  • 최창근;이태열
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 1997.10a
    • /
    • pp.533-538
    • /
    • 1997
  • Topology optimization of a concrete structure is discussed using an Evolutionary Structural Optimization(ESO) method introduced by Xie and Steven. During the evolution process low stressed materials are progressively removed from the structure. This paper discussed a proper rejection criterion(RC) to get a more reasonable topology of concrete structure. Some examples are presented to illustrate the optimum topology achieved by such a procedure.

  • PDF