• Title/Summary/Keyword: Generation Constraint

Search Result 188, Processing Time 0.028 seconds

Security Constrained Optimal Power Flow by Hybrid Algorithms (하이브리드 알고리즘을 응용하여 안전도제약을 만족시키는 최적전력조류)

  • Kim, Gyu-Ho;Lee, Sang-Bong;Lee, Jae-Gyu;Yu, Seok-Gu
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.6
    • /
    • pp.305-311
    • /
    • 2000
  • This paper presents a hybrid algorithm for solving optimal power flow(OPF) in order to enhance a systems capability to cope with outages, which is based on combined application of evolutionary computation and local search method. The efficient algorithm combining main advantages of two methods is as follows : Firstly, evolutionary computation is used to perform global exploitation among a population. This gives a good initial point of conventional method. Then, local methods are used to perform local exploitation. The hybrid approach often outperforms either method operating alone and reduces the total computation time. The objective function of the security constrained OPF is the minimization of generation fuel costs and real power losses. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). In OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The method proposed is applied to IEEE 30 buses system to show its effectiveness.

  • PDF

MODIFIED DOUBLE SNAKE ALGORITHM FOR ROAD FEATURE UPDATING OF DIGITAL MAPS USING QUICKBIRD IMAGERY

  • Choi, Jae-Wan;Kim, Hye-Jin;Byun, Young-Gi;Han, You-Kyung;Kim, Yong-Il
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.234-237
    • /
    • 2007
  • Road networks are important geospatial databases for various GIS (Geographic Information System) applications. Road digital maps may contain geometric spatial errors due to human and scanning errors, but manually updating roads information is time consuming. In this paper, we developed a new road features updating methodology using from multispectral high-resolution satellite image and pre-existing vector map. The approach is based on initial seed point generation using line segment matching and a modified double snake algorithm. Firstly, we conducted line segment matching between the road vector data and the edges of image obtained by Canny operator. Then, the translated road data was used to initialize the seed points of the double snake model in order to refine the updating of road features. The double snake algorithm is composed of two open snake models which are evolving jointly to keep a parallel between them. In the proposed algorithm, a new energy term was added which behaved as a constraint. It forced the snake nodes not to be out of potential road pixels in multispectral image. The experiment was accomplished using a QuickBird pan-sharpened multispectral image and 1:5,000 digital road maps of Daejeon. We showed the feasibility of the approach by presenting results in this urban area.

  • PDF

Windows Program Package Development for Optimal Pourer Flour Analysis (최적전력조류 해석을 위한 원도우프로그램 팩키지 개발)

  • Kim, Gyu-Ho;Lee, Sang-Bong;Lee, Jae-Gyu;Yu, Seok-Gu
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.12
    • /
    • pp.584-590
    • /
    • 2001
  • This paper presents a windows program package for solving security constrained OPF in interconnected Power systems, which is based on the combined application of evolutionary programming(EP) and sequential quadratic programming(SQP). The objective functions are the minimization of generation fuel costs and system power losses. The control variables are the active power of the generating units, the voltage magnitude of the generator, transformer tap settings and SYC setting. The state variables are the bus voltage magnitude, the reactive power of the generating unit, line flows and the tie line flow In OPF considering security, the outages are selected by contingency ranking method. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). The OPF package proposed is applied to IEEE 14 buses and 10 machines 39 buses model system.

  • PDF

Appearance Information Extraction and Shading for Realistic Caricature Generation (실사형 캐리커처 생성을 위한 형태 정보 추출 및 음영 함성)

  • Park, Yeon-Chool;Oh, Hae-Seok
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.257-266
    • /
    • 2004
  • This paper proposes caricature generation system that uses shading mechanism that extracts textural features of face. Using this method, we can get more realistic caricature. Since this system If vector-based, the generated character's face has no size limit and constraint. so it is available to transform the shape freely and to apply various facial expressions to 2D face. Moreover, owing to the vector file's advantage, It can be used in mobile environment as small file size This paper presents methods that generate vector-based face, create shade and synthesize the shade with the vector face.

Analysis and Design of Jumping Robot System Using the Model Transformation Method

  • Suh Jin-Ho;Yamakita Masaki
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.2
    • /
    • pp.200-210
    • /
    • 2006
  • This paper proposes the motion generation method in which the movement of the 3-links leg subsystem in constrained to slider-link and a singular posture can be easily avoided. This method is the realization of jumping control moving in a vertical direction, which mimics a cat's behavior. To consider the movement from the point of the constraint mechanical system, a robotics system for realizing the motion will change its configuration according to the position. The effectiveness of the proposed scheme is illustrated by simulation and experimental results.

Efficient Generation of Spatiotemporal Images for Leukocyte Motion Detection in Microvessels

  • Kim, Eung Kyeu;Jang, Byunghyun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.2
    • /
    • pp.76-84
    • /
    • 2017
  • This paper presents an efficient method for generating spatiotemporal images in order to detect leukocyte motion in microvessels. Leveraging the constraint that leukocytes move along the contour line of the blood vessel wall, our proposed method efficiently generates spatiotemporal images for leukocyte motion detection. To that end, translational motion caused by in vivo movement is first removed by a template matching method. Second, the blood vessel region is detected by an automatic threshold selection method in order to binarize temporal variance images. Then, the contour of the blood vessel wall is expressed via B-spline function. Finally, using the detected blood vessel wall's contour as an initial curve, the plasma layer for the most accurate position is determined in order to find the spatial axis via snake, and the spatiotemporal images are generated. Experimental results show that the spatiotemporal images are generated effectively through comparison of each step with three images.

Scheduling for Virtual MIMO in Single Carrier FDMA (SC-FDMA) System

  • Kim, Jinwoo;Hwang, In Seok;Kang, Chung Gu
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.27-33
    • /
    • 2015
  • In this paper, we consider a joint frequency-domain scheduling and user-pairing problem for virtual MIMO in the single carrier frequency division multiple access (SC-FDMA) system, e.g., the uplink transmission for third generation partnership project-long term evolution (3GPP-LTE) standard. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling so as to deal with the complexity issue in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.

Reference Trajectory Design for Atmosphere Re-entry of Transportation Mechanical Structure (수송기계구조물의 대기권 재진입 기준궤도 설계)

  • Park, J.H.;Eom, W.S.
    • Journal of Power System Engineering
    • /
    • v.7 no.4
    • /
    • pp.67-73
    • /
    • 2003
  • The entry guidance design involves trajectory optimization and generation of a drag acceleration profile as the satisfaction of trajectory conditions during the entry flight. The reference trajectory is parameterized and optimized as piecewise linear functions of the velocity. A regularization technique is employed to achieve desired properties of the optimal drag profile. The regularized problem has smoothness properties and the minimization of performance index then prevents the drag acceleration from varying too fast, thus eliminating discontinuities. This paper shows the trajectory control using the simple control law as well as the information of reference drag acceleration.

  • PDF

An Algorithm of Automatic 2D Quadrilateral Mesh Generation with the Line Constraints (라인(line) 제약조건을 가지는 2차원 사각 메쉬의 자동 생성 알고리즘)

  • 김인일;이규열;조두연;김태완
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.1
    • /
    • pp.10-18
    • /
    • 2003
  • FEM (Finite Element Method) is a fundamental numerical analysis technique in wide spread use in engineering application. As the solving time occupies small portion of entire FEM analysis time because of development of hardware, the relative lime to the whole analysis time to make mesh mod-els is growing. In particular, in the case of stiffeners such as features attached to plate in ship structure, the line constraints are imposed on mesh model together with other constraints such as holes. To auto-matically generate two dimensional quadrilateral mesh with the line constraints, an algorithm is pro-posed based on the constrained Delaunay triangulation and Q-Morph algorithm in which the line constraints are not considered. The performance of the proposed algorithm is evaluated. And some numerical results of our proposed algorithm ate presented.

Soft-State Bandwidth Reservation Mechanism for Slotted Optical Burst Switching Networks

  • Um, Tai-Won;Choi, Jun-Kyun;Guo, Jun;Ryu, Won;Lee, Byung-Sun
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.216-226
    • /
    • 2008
  • This paper proposes a novel transport network architecture for the next generation network (NGN) based on the optical burst switching technology. The proposed architecture aims to provide efficient delivery of various types of network traffic by satisfying their quality-of-service constraints. To this end, we have developed a soft-state bandwidth reservation mechanism, which enables NGN transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of numerical analysis and NS2 simulation. Our results show that the packet delay is kept within the constraint for each traffic flow and the burst loss rate is remarkably improved.

  • PDF