• Title/Summary/Keyword: 병렬 유전 알고리즘

Search Result 62, Processing Time 0.031 seconds

A Parallel Genetic Algorithm for Unit Commitment Problem (병렬유전알고리즘을 이용한 발전기의 기동정지계획)

  • Mun, K.J.;Kim, H.S.;Park, J.H.;Park, T.H.;Ryu, K.R.;Chung, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 1996.11a
    • /
    • pp.137-140
    • /
    • 1996
  • This paper proposes a unit commitment scheduling method based on Parallel Genetic Algorithm(PGA). Due to a variety of constraints to be satisfied, such as the minimum up and down time constraints, the search space of the UC problem is highly nonconvex. So, we used transputer which is one of the practical parallel processors. It can give us fastness and effectiveness features of the proposed method for solving the problem. To show the effectiveness of the PGA based unit commitment scheduling, we tested results for system of 5 units and we can get desirable results.

  • PDF

GA based Selection Method of Weighting Matrices in LQ Controller for SVC (GA를 이용한 SVC용 LQ 제어기의 가중행렬 선정 기법)

  • 허동렬;이정필;주석민;정형환
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.16 no.6
    • /
    • pp.40-50
    • /
    • 2002
  • In this paper, we present a GA(Genetic Algorithm) approach to select weighting matrices of an optimal LQ(Linear Quadratic) controller for SVC(Static VAR Compensator). A SVC, one of the FACTS(Flexible AC Transmission System), constructed by a FC(Fixed Capacitor) and a TCR(Thyristor Controlled Reactor), was designed and implemented to improve the damping of a synchronous generator, as well as to control the system voltage Also, a design of LQ controller depends on choosing weighting matrices. The selection of weighting matrices which is not a trivial solution is usually carried out by trial and error. We proposed an efficient method using GA of finding weighting matrices for optimal control law. Thus, we proved the usefulness of proposed method to improve the stability of single machine-infinite bus with SVC system by eigenvalues analysis and simulation.

Derivation of a Tank Model with a Conceptual Rainfall-Infiltration Process (개념적 강우-침투 과정을 고려한 탱크 모형의 유도)

  • Park, Haen-Nim;Cho, Won-Cheol
    • Journal of Korea Water Resources Association
    • /
    • v.39 no.1 s.162
    • /
    • pp.47-57
    • /
    • 2006
  • This study derives an event-based tank model with a conceptual rainfall-infiltration process, modifying conventional tank models. The model comprises two serial tanks, one parallel tank and an infiltration regulating element. The infiltration process within the element is not represented as a function of only time, but as a function of soil moisture content for three possible cases owing to the relationship between rainfall intensity and infiltration capacity. This study considers the previous soil moisture condition of a watershed by using antecedent precipitation index. Six parameters of the model are identified by using the real coded genetic algorithm. The applicability and validity of the proposed model are assessed for the observed stormwater data from the research basin of the International Hydrological Program, the Pyeongchanggang River basin, Republic of Korea. The results computed streamflows show relatively good agreement with observed ones.

Time Series Perturbation Modeling Algorithm : Combination of Genetic Programming and Quantum Mechanical Perturbation Theory (시계열 섭동 모델링 알고리즘 : 운전자 프로그래밍과 양자역학 섭동이론의 통합)

  • Lee, Geum-Yong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.277-286
    • /
    • 2002
  • Genetic programming (GP) has been combined with quantum mechanical perturbation theory to make a new algorithm to construct mathematical models and perform predictions for chaotic time series from real world. Procedural similarities between time series modeling and perturbation theory to solve quantum mechanical wave equations are discussed, and the exemplary GP approach for implementing them is proposed. The approach is based on multiple populations and uses orthogonal functions for GP function set. GP is applied to original time series to get the first mathematical model. Numerical values of the model are subtracted from the original time series data to form a residual time series which is again subject to GP modeling procedure. The process is repeated until predetermined terminating conditions are met. The algorithm has been successfully applied to construct highly effective mathematical models for many real world chaotic time series. Comparisons with other methodologies and topics for further study are also introduced.

Forward kinematic analysis of a 6-DOF parallel manipulator using genetic algorithm (유전 알고리즘을 이용한 6자유도 병렬형 매니퓰레이터의 순기구학 해석)

  • 박민규;이민철;고석조
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1624-1627
    • /
    • 1997
  • The 6-DOF parallel manipulator is a closed-kindmatic chain robot manipulator that is capable of providing high structural rigidity and positional accuracy. Because of its advantage, the parallel manipulator have been widely used in many engineering applications such as vehicle/flight driving simulators, rogot maniplators, attachment tool of machining centers, etc. However, the kinematic analysis for the implementation of a real-time controller has some problem because of the lack of an efficient lagorithm for solving its highly nonliner forward kinematic equation, which provides the translational and orientational attitudes of the moveable upper platform from the lenght of manipulator linkages. Generally, Newton-Raphson method has been widely sued to solve the forward kinematic problem but the effectiveness of this methodology depend on how to set initial values. This paper proposes a hybrid method using genetic algorithm(GA) and Newton-Raphson method to solve forward kinematics. That is, the initial values of forward kinematics solution are determined by adopting genetic algorithm which can search grobally optimal solutions. Since determining this values, the determined values are used in Newton-Raphson method for real time calcuation.

  • PDF

Parameter Identifications of Roll Maneuvering Coefficients Based on Sea Trial Data (해상 실측 자료를 이용한 횡동요 조종 계수 식별)

  • C.K. Kim
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.35 no.2
    • /
    • pp.29-37
    • /
    • 1998
  • Linear equations of motion for submersibles are one of the rest important design parameters, which are used as a governing equation for the shape design and the controller design. But, the estimated maneuvering coefficients in equations of motion by using empirical formulae, theoretical calculations or model tests might have some errors. Therefore the maneuvering coefficients should be verified from sea trial test. In this study, parallel extended Kalman filter method, Nelder & Mead Simplex method and genetic algorithm were applied to the parameter identification of roll maneuvering coefficients based on sea trial data. As a result, it was verified that Nelder & Mead Simplex method gave the most satisfactory results for the mathmatical models and the sea trial data used in this study.

  • PDF

Optimal Economic Load Dispatch using Parallel Genetic Algorithms in Large Scale Power Systems (병렬유전알고리즘을 응용한 대규모 전력계통의 최적 부하배분)

  • Kim, Tae-Kyun;Kim, Kyu-Ho;Yu, Seok-Ku
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.4
    • /
    • pp.388-394
    • /
    • 1999
  • This paper is concerned with an application of Parallel Genetic Algorithms(PGA) to optimal econmic load dispatch(ELD) in power systems. The ELD problem is to minimize the total generation fuel cost of power outputs for all generating units while satisfying load balancing constraints. Genetic Algorithms(GA) is a good candidate for effective parallelization because of their inherent principle of evolving in parallel a population of individuals. Each individual of a population evaluates the fitness function without data exchanges between individuals. In application of the parallel processing to GA, it is possible to use Single Instruction stream, Multiple Data stream(SIMD), a kind of parallel system. The architecture of SIMD system need not data communications between processors assigned. The proposed ELD problem with C code is implemented by SIMSCRIPT language for parallel processing which is a powerfrul, free-from and versatile computer simulation programming language. The proposed algorithms has been tested for 38 units system and has been compared with Sequential Quadratic programming(SQP).

  • PDF

Parallel Hybrid Genetic Algorithm-Tabu Search for Distribution System Reconfiguration Using PC Cluster System (배전계통 재구성 문제에 PC클러스터 시스템을 이용한 병렬 유전 알고리즘-타부탐색법 구현)

  • Mun K. J.;Kim H. S.;Park J. H.;Lee H. S.;Kang H. T.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.36-38
    • /
    • 2004
  • This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a recokiguration in distribution system. In parallel hybrid CA-TS, after CA operations, stings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population, if there's no improvement for the predetermined iteration, local search procedure is executed by TS for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution system in the reference paper.

  • PDF

Parallel Hybrid Genetic Algorithm-Tabu Search for Distribution System Service Restoration Using PC Cluster System (배전계통 고장복구 문제에 PC 클러스터 시스템을 이용한 병렬 유전 알고리즘-타부탐색법 구현)

  • Mun K. J.;Kim H. S.;Park J. H.;Lee H. S.;Kang H. T.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.446-448
    • /
    • 2004
  • This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution system. In parallel hybrid GA-TS, after GA operations, strings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population. If there's no improvement for the predetermined iteration, local search procedure is executed by f for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a practical distribution system in Korea.

  • PDF

PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems (PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구)

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.8
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.