• 제목/요약/키워드: evolution algorithm

검색결과 637건 처리시간 0.036초

Evolution Strategy를 이용한 로봇 매니퓰레이터의 슬라이딩 모드 제어 (Sliding Mode Control for Robot Manipulator Usin Evolution Strategy)

  • 김현식;박진현;최영규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.379-382
    • /
    • 1996
  • Evolution Strategy is used as an effective search algorithm in optimization problems and Sliding Mode Control is well known as a robust control algorithm. In this paper, we propose a Sliding Mode Control Method for robot manipulator using Evolution Strategy. Evolution Strategy is used to estimate Sliding Mode Control Parameters such as sliding surface gradient, continuous function boundary layer, unknown plant parameters and switching gain. Experimental results show the proposed control scheme has accurate and robust performances with effective search ability.

  • PDF

외판원 문제를 위한 난수 키 표현법 기반 차분 진화 알고리즘 (Differential Evolution Algorithm based on Random Key Representation for Traveling Salesman Problems)

  • 이상욱
    • 한국콘텐츠학회논문지
    • /
    • 제20권11호
    • /
    • pp.636-643
    • /
    • 2020
  • 차분 진화 알고리즘은 연속적인 문제 공간인 실수 최적화 문제를 해결하기 위해 개발된 메타휴리스틱 기법 중에 하나이다. 본 연구에서는 차분 진화 알고리즘을 불연속적인 문제 공간인 외판원 문제 해결에 사용하기 위하여 차분 진화 알고리즘에 난수 키 표현법을 적용하였다. 차분 진화 알고리즘은 실수 공간을 탐색하고 오름 차순으로 정렬된 해의 인덱스의 순서를 도시 방문 순서로 하여 적합도를 구한다. TSPLIB에서 제공하는 표준 외판원 문제에 적용하여 실험한 결과 제안한 난수 키 표현법 기반 차분 진화 알고리즘이 외판원 문제 해결에 가능성을 가지고 있음을 확인하였다.

Differential Evolution Algorithm for Job Shop Scheduling Problem

  • Wisittipanich, Warisa;Kachitvichyanukul, Voratas
    • Industrial Engineering and Management Systems
    • /
    • 제10권3호
    • /
    • pp.203-208
    • /
    • 2011
  • Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

네트워크 문제를 위한 새로운 진화 알고리즘에 대하여 (On a New Evolutionary Algorithm for Network Optimization Problems)

  • 석상문
    • 한국경영과학회지
    • /
    • 제32권2호
    • /
    • pp.109-121
    • /
    • 2007
  • This paper focuses on algorithms based on the evolution, which is applied to various optimization problems. Especially, among these algorithms based on the evolution, we investigate the simple genetic algorithm based on Darwin's evolution, the Lamarckian algorithm based on Lamark's evolution and the Baldwin algorithm based on the Baldwin effect and also Investigate the difference among them in the biological and engineering aspects. Finally, through this comparison, we suggest a new algorithm to find more various solutions changing the genotype or phenotype search space and show the performance of the proposed method. Conclusively, the proposed method showed superior performance to the previous method which was applied to the constrained minimum spanning tree problem and known as the best algorithm.

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

  • 정재준;이태희
    • 대한기계학회논문집A
    • /
    • 제27권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.

차분진화 알고리즘을 이용한 회전형 역 진자 시스템의 최적 퍼지 제어기 설계 (Design of Optimized Fuzzy Controller for Rotary Inverted Pendulum System Using Differential Evolution)

  • 김현기;이동진;오성권
    • 전기학회논문지
    • /
    • 제60권2호
    • /
    • pp.407-415
    • /
    • 2011
  • In this study, we propose the design of optimized fuzzy controller for the rotary inverted pendulum system by using differential evolution algorithm. The structure of the differential evolution algorithm has a simple structure and its convergence to optimal values is superb in comparison to other optimization algorithms. Also the differential evolution algorithm is easier to use because it have simpler mathematical operators and have much less computational time when compared with other optimization algorithms. The rotary inverted pendulum system is nonlinear and has a unstable motion. The objective is to control the position of the rotating arm and to make the pendulum to maintain the unstable equilibrium point at vertical position. The output performance of the proposed fuzzy controller is considered from the viewpoint of performance criteria such as overshoot, steady-state error, and settling time through simulation and practical experiment. From the result of both simulation and practical experiment, we evaluate and analyze the performance of the proposed optimal fuzzy controller from the comparison between PGAs and differential evolution algorithms. Also we show the superiority of the output performance as well as the characteristic of differential evolution algorithm.

MIN-SUM 복호화 알고리즘을 이용한 LDPC 오류정정부호의 성능분석 (Convergence of Min-Sum Decoding of LDPC codes under a Gaussian Approximation)

  • Heo, Jun
    • 한국통신학회논문지
    • /
    • 제28권10C호
    • /
    • pp.936-941
    • /
    • 2003
  • 최근에 소개된 density evolution 기법은 sum-product 알고리즘에서 LDPC 부호가 갖는 성능의 한계를 분석하였다[1]. 또한. Iterative decoding 알고리즘에서 전달되는 정보가 Gaussian 확률분포를 갖는 점을 이용하여 기존의 density evolution 기법을 단순화 시킨 연구결과가 소개되었다[2]. 한편. LDPC 부호의 한계 성능을 sum-product가 아닌 min-sum 알고리즘에서 분석한 결과가 최근에 발표되었다[3]. 본 논문에서는 이러한 일련의 연구 결과를 바탕으로 min-sum 알고리즘을 이용하면서 Gaussian 확률 분포 특성을 이용한 density evolution 기법을 소개한다. 제안된 density evolution 기법은 기존의 방법보다 적은 계산으로 정확한 threshold를 구할 수 있으며. 그 결과가 numerical simulation 결과와 잘 일치함을 나타내었다.

A Hybrid Estimation of Distribution Algorithm with Differential Evolution based on Self-adaptive Strategy

  • Fan, Debin;Lee, Jaewan
    • 인터넷정보학회논문지
    • /
    • 제22권1호
    • /
    • pp.1-11
    • /
    • 2021
  • Estimation of distribution algorithm (EDA) is a popular stochastic metaheuristic algorithm. EDA has been widely utilized in various optimization problems. However, it has been shown that the diversity of the population gradually decreases during the iterations, which makes EDA easily lead to premature convergence. This article introduces a hybrid estimation of distribution algorithm (EDA) with differential evolution (DE) based on self-adaptive strategy, namely HEDADE-SA. Firstly, an alternative probability model is used in sampling to improve population diversity. Secondly, the proposed algorithm is combined with DE, and a self-adaptive strategy is adopted to improve the convergence speed of the algorithm. Finally, twenty-five benchmark problems are conducted to verify the performance of HEDADE-SA. Experimental results indicate that HEDADE-SA is a feasible and effective algorithm.

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
    • /
    • 제19권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.

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
    • /
    • 제21권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.