• Title/Summary/Keyword: premature convergence

Search Result 98, Processing Time 0.034 seconds

A Study with Genetic Algorithm Applied to Distribution Systems Reconfiguration for Loss Minimization (유전알고리즘을 이용한 배전계통의 손실 최소화에 관한 연구)

  • Yoon, Chang-Dae;Choi, Sang-Youl;Shin, Myung-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2001.11b
    • /
    • pp.330-332
    • /
    • 2001
  • Distribution systems is consist of network in physical and radial in electrical aspect. Therefore radial operation is realized by changing the status of sectionalizing switches, and is usually done for loss reduction in the system. In this paper, we propose a optimal method for distribution systems reconfiguration. Specifically we use genetic algorithm method to solve distribution systems reconfiguration for loss minimization problem. A genetic algorithm(GA) is set up, in which some improvements are made on string coding, fitness function and mutation pattern. As a result, premature convergence is avoided.

  • PDF

A Study on the Choice of Fuzzy Rule Genetic Algorithm Using Similarity Check Method (유사성 체크 방법을 이용한 Fuzzy Rule선택 Genetic Algorithm에 관한 연구)

  • Kang, Jeon-Geun;Kim, Myeong-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.731-734
    • /
    • 2017
  • GA(Genetic Algorithm)는 자연계 진화 과정의 적자생존의 유전적 부호화 및 처리과정을 모델링함으로서 해석적으로 처리하기 힘든 문제의 최적화에 널리 이용하고 있으며, 퍼지제어에서 룰의 선택에도 적용된다. 본 논문에서는 일반적인 GA방법에 자료의 유사성을 체크하는 방법을 도입하여 Fuzzy Rule선택 환경에 적용하고 시뮬레이션을 통해 이를 확인한다. 시뮬레이션 결과 제안된 SFRGA(Similarity Fuzzy Rule Genetic Algorithm)방법은 일반적 GA방법보다 단축된 지연시간 효과와 부수적으로 조기포화 현상(premature convergence)의 감소 및 자동 배정 퍼지 클리스터링(Fuzzy clustering)의 가능성을 얻을 수 있었다.

The Schema Extraction Method for GA Preserving Diversity of the Distributions in Population (개체 분포의 다양성을 유지시키는 GA를 위한 스키마 추출 기법)

  • Jo, Yong-Gun;Jang, Sung-Hwan;Hoon Kang
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.232-235
    • /
    • 2000
  • In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve the Traveling Salesman Problem(TSP). Because TSP is a well-known combinatorial optimization problem and belongs to a NP-complete problem, there is a huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. In addition, we have the non-schema part to be applied to inversion as well as for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

  • PDF

Fuzzy Reasoning based Selection Operator for Genetic Algorithm (퍼지 추론 기반의 유전알고리즘 선택 연산자)

  • Seo, Ki-Sung;Hyun, Soo-Hwan
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.116-121
    • /
    • 2008
  • This paper introduces a selection operator which utilized similarity and fitness of individuals based on fuzzy inference. Adding similarity feature to fitness, proposed selector obtained the decrease of premature convergence and better performances than other selectors. Moreover, an adoption of steady-state evolution provided enhancement of performances additionally. Experiments of proposed method for deceptive problems were tested and showed better performances than conventional methods.

Queen-bee and Mutant-bee Evolution for Genetic Algorithms

  • Jung, Sung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.3
    • /
    • pp.417-422
    • /
    • 2007
  • A new evolution method termed queen-bee and mutant-bee evolution is based on the previous queen-bee evolution [1]. Even though the queen-bee evolution has shown very good performances, two parameters for strong mutation are added to the genetic algorithms. This makes the application of genetic algorithms with queen-bee evolution difficult because the values of the two parameters are empirically decided by a trial-and-error method without a systematic method. The queen- bee and mutant-bee evolution has no this problem because it does not need additional parameters for strong mutation. Experimental results with typical problems showed that the queen-bee and mutant-bee evolution produced nearly similar results to the best ones of queen-bee evolution even though it didn't need to select proper values of additional parameters.

Sexual Reproduction Genetic Algorithms: The Effects of Multi-Selection & Diploidy on Search Performances (유성생식 유전알고리즘 : 다중선택과 이배성이 탐색성능에 미치는 영향)

  • Ryu, K.B.;Choi, Y.J.;Kim, C.E.;Lee, H.S.;Jung, C.K.
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.1006-1010
    • /
    • 1995
  • This paper describes Sexual Reproduction Genetic Algorithm(SRGA) for function optimization. In SRGA, each individual utilize a diploid chromosome structure. Sex cells(gametes) are produced through artificial meiosis in which crossover and mutation occur. The proposed method has two selection operators, one, individual selection which selects the individual to fertilize, and the other, gamete selection which makes zygote for offspring production. We consider the effects of multi-selection and diploidy on search performance. SRGA improves local and global search(exploitation and exploration) and show optimum tracking performance in nonstationary environments. Gray coding is incorporated to transforming the search space and Genic uniform distribution method is proposed to alleviate the problem of premature convergence.

  • PDF

Evolution Program for Optimal Capacity Expansion with Backlogs in Demand (수요를 고려한 잔고의 최적 Capacity 확장을 위한 진화 프로그램)

  • Jo, Jeong-Bok;Yang, Hwang-Gyu;Lee, Jae-Uk;Ham, Chang-Hyeon;Boading Liu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.3
    • /
    • pp.672-680
    • /
    • 1999
  • This paper presents an evolution program for optimal expansion problem with backlogs in demand which is to determine when and how much capacity should be added under varying types of demand and cost. To overcome premature convergence and stalling, we employ an exponential-fitness scaling scheme. To improve the chromosomes, we introduce hetero-dimensional mutation which generates a new dimension and produces a feasible solution, and homo-dimensional mutation which mutates the chromosomes in the negative of gradient direction. Finally, a numerical example is discussed.

  • PDF

A Modified Particle Swarm Optimization Algorithm : Information Diffusion PSO (새로운 위상 기반의 Particle Swarm Optimization 알고리즘 : 정보파급 PSO)

  • Park, Jun-Hyuk;Kim, Byung-In
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.3
    • /
    • pp.163-170
    • /
    • 2011
  • This paper proposes a modified version of Particle Swarm Optimization (PSO) called Information Diffusion PSO (ID-PSO). In PSO algorithms, premature convergence of particles could be prevented by defining proper population topology. In this paper, we propose a variant of PSO algorithm using a new population topology. We draw inspiration from the theory of information diffusion which models the transmission of information or a rumor as one-to-one interactions between people. In ID-PSO, a particle interacts with only one particle at each iteration and they share their personal best solutions and recognized best solutions. Each particle recognizes the best solution that it has experienced or has learned from another particle as the recognized best. Computational experiments on the benchmark functions show the effectiveness of the proposed algorithm compared with the existing methods which use different population topologies.

An Improved Particle Swarm Optimization for Economic Dispatch Problems with Prohibited Operating Zones (경제급전 문제에의 개선된 PSO 알고리즘 적용)

  • Jeong, Yun-Won;Lee, Woo-Nam;Kim, Hyun-Houng;Park, Jong-Bae;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.850-851
    • /
    • 2007
  • This paper presents an efficient approach for solving the economic dispatch (ED) problems with prohibited operating zones using an improved particle swarm optimization (PSO). Although the PSO-based approaches have several advantages suitable to the heavily constrained nonconvex optimization problems, they still have the drawbacks such as local optimal trapping due to the premature convergence (i.e., exploration problem) and insufficient capability to find nearly-by extreme points (i.e., exploitation problem). This paper proposes an improved PSO framework adopting a crossover operation scheme to increase both exploration and exploitation capability of the PSO. The proposed method is applied to ED problem with prohibited operating zones. Also, the results are compared with those of the state-of-the-art methods.

  • PDF

Design of Optimized Fuzzy Controller by Means of HFC-based Genetic Algorithms for Rotary Inverted Pendulum System (회전형 역 진자 시스템에 대한 계층적 공정 경쟁 기반 유전자 알고리즘을 이용한 최적 Fuzzy 제어기 설계)

  • Jung, Seung-Hyun;Choi, Jeoung-Nae;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.236-242
    • /
    • 2008
  • In this paper, we propose an optimized fuzzy controller based on Hierarchical Fair Competition-based Genetic Algorithms (HFCGA) for rotary inverted pendulum system. We adopt fuzzy controller to control the rotary inverted pendulum and the fuzzy rules of the fuzzy controller are designed based on the design methodology of Linear Quadratic Regulator (LQR) controller. Simple Genetic Algorithms (SGAs) is well known as optimization algorithms supporting search of a global character. There is a long list of successful usages of GAs reported in different application domains. It should be stressed, however, that GAs could still get trapped in a sub-optimal regions of the search space due to premature convergence. Accordingly the parallel genetic algorithm was developed to eliminate an effect of premature convergence. In particular, as one of diverse types of the PGA, HFCGA has emerged as an effective optimization mechanism for dealing with very large search space. We use HFCGA to optimize the parameter of the fuzzy controller. A comparative analysis between the simulation and the practical experiment demonstrates that the proposed HFCGA based fuzzy controller leads to superb performance in comparison with the conventional LQR controller as well as SGAs based fuzzy controller.