• Title/Summary/Keyword: evolution optimization

Search Result 401, Processing Time 0.027 seconds

Optimal laminate sequence of thin-walled composite beams of generic section using evolution strategies

  • Rajasekaran, S.
    • Structural Engineering and Mechanics
    • /
    • v.34 no.5
    • /
    • pp.597-609
    • /
    • 2010
  • A problem formulation and solution methodology for design optimization of laminated thin-walled composite beams of generic section is presented. Objective functions and constraint equations are given in the form of beam stiffness. For two different problems one for open section and the other for closed section, the objective function considered is bending stiffness about x-axis. Depending upon the case, one can consider bending, torsional and axial stiffnesses. The different search and optimization algorithm, known as Evolution Strategies (ES) has been applied to find the optimal fibre orientation of composite laminates. A multi-level optimization approach is also implemented by narrowing down the size of search space for individual design variables in each successive level of optimization process. The numerical results presented demonstrate the computational advantage of the proposed method "Evolution strategies" which become pronounced to solve optimization of thin-walled composite beams of generic section.

Observation of Bargaining Game using Co-evolution between Particle Swarm Optimization and Differential Evolution (입자군집최적화와 차분진화알고리즘 간의 공진화를 활용한 교섭게임 관찰)

  • Lee, Sangwook
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.11
    • /
    • pp.549-557
    • /
    • 2014
  • Recently, analysis of bargaining game using evolutionary computation is essential issues in field of game theory. In this paper, we observe a bargaining game using co-evolution between two heterogenous artificial agents. In oder to model two artificial agents, we use a particle swarm optimization and a differential evolution. We investigate algorithm parameters for the best performance and observe that which strategy is better in the bargaining game under the co-evolution between two heterogenous artificial agents. Experimental simulation results show that particle swarm optimization outperforms differential evolution in the bargaining game.

Cooperative Coevolution Differential Evolution Based on Spark for Large-Scale Optimization Problems

  • Tan, Xujie;Lee, Hyun-Ae;Shin, Seong-Yoon
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.3
    • /
    • pp.155-160
    • /
    • 2021
  • Differential evolution is an efficient algorithm for solving continuous optimization problems. However, its performance deteriorates rapidly, and the runtime increases exponentially when differential evolution is applied for solving large-scale optimization problems. Hence, a novel cooperative coevolution differential evolution based on Spark (known as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC. First, the large-scale problem is decomposed into several low-dimensional subproblems using the random grouping strategy. Subsequently, each subproblem can be addressed in a parallel manner by exploiting the parallel computation capability of the resilient distributed datasets model in Spark. Finally, the optimal solution of the entire problem is obtained using the cooperation mechanism. The experimental results on 13 high-benchmark functions show that the new algorithm performs well in terms of speedup and scalability. The effectiveness and applicability of the proposed algorithm are verified.

Global Optimization Using Differential Evolution Algorithm (차분진화 알고리듬을 이용한 전역최적화)

  • Jung, Jae-Joon;Lee, Tae-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.11
    • /
    • pp.1809-1814
    • /
    • 2003
  • Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially fur the solution to Chebychev polynomial fitting problem is similar to genetic algorithm(GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than CA, since it employs the difference information as pseudo-sensitivity In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.

Structural Dynamics Modification of Structures Having Non-Conforming Nodes Using Component Mode Synthesis and Evolution Strategies Optimization Technique (부분 구조 모드 합성법 및 유전 전략 최적화 기법을 이용한 비부합 절점을 가진 구조물의 구조변경)

  • 이준호;정의일;박윤식
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.651-659
    • /
    • 2002
  • Component Mode Synthesis (CMS) is a dynamic substructuring technique to get an approximate eigensolutions of large degree-of-freedom structures divisible into several components. But, In practice. most of large structures are modeled by different teams of engineers. and their respective finite element models often require different mesh resolutions. As a result, the finite element substructure models can be non-conforming and/or incompatible. In this work, A hybrid version of component mode synthesis using a localized lagrange multiplier to treat the non-conforming mesh problem was derived. Evolution Strategies (ESs) is a stochastic numerical optimization technique and has shown a robust performance for solving deterministic problems. An ESs conducts its search by processing a population of solutions for an optimization problem based on principles from natural evolution. An optimization example for raising the first natural frequency of a plate structure using beam stiffeners was presented using hybrid component mode synthesis and robust evolution strategies (RES) optimization technique. In the example. the design variables are the positions and lengths of beam stiffeners.

  • PDF

Fast Optimization by Queen-bee Evolution and Derivative Evaluation in Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.4
    • /
    • pp.310-315
    • /
    • 2005
  • This paper proposes a fast optimization method by combining queen-bee evolution and derivative evaluation in genetic algorithms. These two operations make it possible for genetic algorithms to focus on highly fitted individuals and rapidly evolved individuals, respectively. Even though the two operations can also increase the probability that genetic algorithms fall into premature convergence phenomenon, that can be controlled by strong mutation rates. That is, the two operations and the strong mutation strengthen exploitation and exploration of the genetic algorithms, respectively. As a result, the genetic algorithm employing queen-bee evolution and derivative evaluation finds optimum solutions more quickly than those employing one of them. This was proved by experiments with one pattern matching problem and two function optimization problems.

Structural damage detection using a multi-stage improved differential evolution algorithm (Numerical and experimental)

  • Seyedpoor, Seyed Mohammad;Norouzi, Eshagh;Ghasemi, Sara
    • Smart Structures and Systems
    • /
    • v.21 no.2
    • /
    • pp.235-248
    • /
    • 2018
  • An efficient method utilizing the multi-stage improved differential evolution algorithm (MSIDEA) as an optimization solver is presented here to detect the multiple-damage of structural systems. Natural frequency changes of a structure are considered as a criterion for damage occurrence. The structural damage detection problem is first transmuted into a standard optimization problem dealing with continuous variables, and then the MSIDEA is utilized to solve the optimization problem for finding the site and severity of structural damage. In order to assess the performance of the proposed method for damage identification, an experimental study and two numerical examples with considering measurement noise are considered. All the results demonstrate the effectiveness of the proposed method for accurately determining the site and severity of multiple-damage. Also, the performance of the MSIDEA for damage detection compared to the standard differential evolution algorithm (DEA) is confirmed by test examples.

Critical buckling load optimization of the axially graded layered uniform columns

  • Alkan, Veysel
    • Structural Engineering and Mechanics
    • /
    • v.54 no.4
    • /
    • pp.725-740
    • /
    • 2015
  • This study presents critical buckling load optimization of the axially graded layered uniform columns. In the first place, characteristic equations for the critical buckling loads for all boundary conditions are obtained using the transfer matrix method. Then, for each case, square of this equation is taken as a fitness function together with constraints. Due to explicitly unavailable objective function for the critical buckling loads as a function of segment length and volume fraction of the materials, especially for the column structures with higher segment numbers, initially, prescribed value is assumed for it and then the design variables satisfying constraints are searched using Differential Evolution (DE) optimization method coupled with eigen-value routine. For constraint handling, Exterior Penalty Function formulation is adapted to the optimization cycle. Different boundary conditions are considered. The results reveal that maximum increments in the critical buckling loads are attained about 20% for cantilevered and pinned-pinned end conditions and 18% for clamped-clamped case. Finally, the strongest column structure configurations will be determined. The scientific and statistical results confirmed efficiency, reliability and robustness of the Differential Evolution optimization method and it can be used in the similar problems which especially include transcendental functions.

New Boundary-Handling Techniques for Evolution Strategies

  • Park, Han-Lim;Tahk, Min-Jea
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.165.1-165
    • /
    • 2001
  • The evolution strategy is a good evolutionary algorithm to find the global optimum of a real-valued function. Since many engineering problems can be formulated as real valued function optimization, the evolution strategy is frequently employed in engineering fields. However, in many engineering optimization problems, an optimization parameter is often restricted in the bounded region between two specified values, the minimum and the maximum limit, respectively. Since an offspring individual is generated randomly around a parent individual during mutation process of the evolution strategy, an individual outside the search region can be generated even if the parent is inside the search region. This paper proposes two new boundary-handling techniques for evolution strategies. One is the ...

  • PDF

Large Scale Cooperative Coevolution Differential Evolution (대규모 협동진화 차등진화)

  • Shin, Seong-Yoon;Tan, Xujie;Shin, Kwang-Seong;Lee, Hyun-Chang
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.665-666
    • /
    • 2022
  • Differential evolution is an efficient algorithm for continuous optimization problems. However, applying differential evolution to solve large-scale optimization problems quickly degrades performance and exponentially increases runtime. To overcome this problem, a new cooperative coevolution differential evolution based on Spark (referred to as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC.

  • PDF