• Title/Summary/Keyword: adaptive evolutionary algorithm

Search Result 81, Processing Time 0.021 seconds

Optimum Setting of Overcurrent Relay in Distribution Systems Using Adaptive Evolutionary Algorithm (적응진화 알고리즘을 이용한 배전계통의 과전류보호계전기 최적 정정치 결정)

  • Jeong, Hee-Myung;Park, June-Ho;Lee, Hwa-Seok;Mun, Kyeong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2006.07a
    • /
    • pp.252-253
    • /
    • 2006
  • This paper presents OC relay coordination to protect distribution system by Adaptive Evolutionary Algorithm(AEA). AEA is a optimization method to overcome the problems of classical optimization. The results show that the proposed method can improve more optimum relay settings than present available methods.

  • PDF

Crack Identification Using Neuro-Fuzzy-Evolutionary Technique

  • Shim, Mun-Bo;Suh, Myung-Won
    • Journal of Mechanical Science and Technology
    • /
    • v.16 no.4
    • /
    • pp.454-467
    • /
    • 2002
  • It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. Toidentifythelocation and depth of a crack in a structure, a method is presented in this paper which uses neuro-fuzzy-evolutionary technique, that is, Adaptive-Network-based Fuzzy Inference System (ANFIS) solved via hybrid learning algorithm (the back-propagation gradient descent and the least-squares method) and Continuous Evolutionary Algorithms (CEAs) solving sir ale objective optimization problems with a continuous function and continuous search space efficiently are unified. With this ANFIS and CEAs, it is possible to formulate the inverse problem. ANFIS is used to obtain the input(the location and depth of a crack) - output(the structural Eigenfrequencies) relation of the structural system. CEAs are used to identify the crack location and depth by minimizing the difference from the measured frequencies. We have tried this new idea on beam structures and the results are promising.

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

  • Soak, Sang-Moon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.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.

Implementation of an Adaptive Genetic Algorithm Processor for Evolvable Hardware (진화 시스템을 위한 유전자 알고리즘 프로세서의 구현)

  • 정석우;김현식;김동순;정덕진
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.4
    • /
    • pp.265-276
    • /
    • 2004
  • Genetic Algorithm(GA), that is shown stable performance to find an optimal solution, has been used as a method of solving large-scaled optimization problems with complex constraints in various applications. Since it takes so much time to execute a long computation process for iterative evolution and adaptation. In this paper, a hardware-based adaptive GA was proposed to reduce the serious computation time of the evolutionary process and to improve the accuracy of convergence to optimal solution. The proposed GA, based on steady-state model among continuos generation model, performs an adaptive mutation process with consideration of the evolution flow and the population diversity. The drawback of the GA, premature convergence, was solved by the proposed adaptation. The Performance improvement of convergence accuracy for some kinds of problem and condition reached to 5-100% with equivalent convergence speed to high-speed algorithm. The proposed adaptive GAP(Genetic Algorithm Processor) was implemented on FPGA device Xilinx XCV2000E of EHW board for face recognition.

Meta-heuristic Method for the Single Source Capacitated Facility Location Problem (물류 센터 위치 선정 및 대리점 할당 모형에 대한 휴리스틱 해법)

  • Soak, Sang-Moon;Lee, Sang-Wook
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.107-116
    • /
    • 2010
  • The facility location problem is one of the traditional optimization problems. In this paper, we deal with the single source capacitated facility location problem (SSCFLP) and it is known as an NP-hard problem. Thus, it seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the SSCFLP. This paper introduces a new efficient evolutionary algorithm for the SSCFLP. The proposed algorithm is devised by incorporating a general adaptive link adjustment evolutionary algorithm and three heuristic local search methods. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds optimum solutions at almost all middle size test instances and very stable solutions at larger size test instances.

An evolutionary hybrid optimization of MARS model in predicting settlement of shallow foundations on sandy soils

  • Luat, Nguyen-Vu;Nguyen, Van-Quang;Lee, Seunghye;Woo, Sungwoo;Lee, Kihak
    • Geomechanics and Engineering
    • /
    • v.21 no.6
    • /
    • pp.583-598
    • /
    • 2020
  • This study is attempted to propose a new hybrid artificial intelligence model called integrative genetic algorithm with multivariate adaptive regression splines (GA-MARS) for settlement prediction of shallow foundations on sandy soils. In this hybrid model, the evolution algorithm - Genetic Algorithm (GA) was used to search and optimize the hyperparameters of multivariate adaptive regression splines (MARS). For this purpose, a total of 180 experimental data were collected and analyzed from available researches with five-input variables including the bread of foundation (B), length to width (L/B), embedment ratio (Df/B), foundation net applied pressure (qnet), and average SPT blow count (NSPT). In further analysis, a new explicit formulation was derived from MARS and its accuracy was compared with four available formulae. The attained results indicated that the proposed GA-MARS model exhibited a more robust and better performance than the available methods.

Adaptive Learning Control of Neural Network Using Real-Time Evolutionary Algorithm (실시간 진화 알고리듬을 통한 신경망의 적응 학습제어)

  • Chang, Sung-Ouk;Lee, Jin-Kul
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.6
    • /
    • pp.1092-1098
    • /
    • 2002
  • This paper discusses the composition of the theory of reinforcement teaming, which is applied in real-time teaming, and evolutionary strategy, which proves its the superiority in the finding of the optimal solution at the off-line teaming method. The individuals are reduced in order to team the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It is possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because of the teaming process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes. In the future, studies are needed on the proof of the theory through experiments and the characteristic considerations of the robustness against the outside disturbances.

Detection for JPEG steganography based on evolutionary feature selection and classifier ensemble selection

  • Ma, Xiaofeng;Zhang, Yi;Song, Xiangfeng;Fan, Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5592-5609
    • /
    • 2017
  • JPEG steganography detection is an active research topic in the field of information hiding due to the wide use of JPEG image in social network, image-sharing websites, and Internet communication, etc. In this paper, a new steganalysis method for content-adaptive JPEG steganography is proposed by integrating the evolutionary feature selection and classifier ensemble selection. First, the whole framework of the proposed steganalysis method is presented and then the characteristic of the proposed method is analyzed. Second, the feature selection method based on genetic algorithm is given and the implement process is described in detail. Third, the method of classifier ensemble selection is proposed based on Pareto evolutionary optimization. The experimental results indicate the proposed steganalysis method can achieve a competitive detection performance by compared with the state-of-the-art steganalysis methods when used for the detection of the latest content-adaptive JPEG steganography algorithms.

A Study on State Estimation in Power Systems Using Adaptive Evolutionary Algorithm (적응진화 알고리즘을 이용한 전력계통의 상태추정에 관한 연구)

  • Jeong, Hee-Myung;Kim, Hyung-Su;Park, June-Ho;Lee, Hwa-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2006.07a
    • /
    • pp.214-215
    • /
    • 2006
  • In power systems, the state estimation takes an important role in security control. At present, the weighted least squares(WLS) method has been widely used to the state estimation computation. This paper presents an application of Adaptive Evolutionary Algorithm(AEA) to state estimation in power systems. AEA is a optimization method to overcome the problems of classical optimization. AEA is employed to solve state estimation on the 6 bus system.

  • PDF

Symbiotic Organisms Search for Constrained Optimization Problems

  • Wang, Yanjiao;Tao, Huanhuan;Ma, Zhuang
    • Journal of Information Processing Systems
    • /
    • v.16 no.1
    • /
    • pp.210-223
    • /
    • 2020
  • Since constrained optimization algorithms are easy to fall into local optimum and their ability of searching are weak, an improved symbiotic organisms search algorithm with mixed strategy based on adaptive ε constrained (ε_SOSMS) is proposed in this paper. Firstly, an adaptive ε constrained method is presented to balance the relationship between the constrained violation degrees and fitness. Secondly, the evolutionary strategies of symbiotic organisms search algorithm are improved as follows. Selecting different best individuals according to the proportion of feasible individuals and infeasible individuals to make evolutionary strategy more suitable for solving constrained optimization problems, and the individual comparison criteria is replaced with population selection strategy, which can better enhance the diversity of population. Finally, numerical experiments on 13 benchmark functions show that not only is ε_SOSMS able to converge to the global optimal solution, but also it has better robustness.