• Title/Summary/Keyword: Optimal Reconfiguration

Search Result 68, Processing Time 0.033 seconds

A Study on Enhancement Method of Hosting Capacity for PV System Based on Primary Feeder Reconfiguration (배전선로 절체에 의한 태양광전원의 수용성 향상방안에 관한 연구)

  • Lee, Myung-Geun;Lee, Hu-Dong;Ferreira, Marito;Park, Ji-Hyun;Tae, Dong-Hyun;Rho, Dae-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.11
    • /
    • pp.239-249
    • /
    • 2019
  • Recently, the Korean government has implemented a policy to expand renewable energy sources. Large-scale PV systems are being actively interconnected with the distribution system. On the other hand, when a large-scale PV system is installed and operated, the customer voltages could violate the allowable voltage limit due to reverse power flow of the PV system. To overcome these problems, an enhancement method for hosting the capacity of the PV system in a distribution system is being actively conducted. Therefore, to improve the hosting capacity of the PV system, this paper proposes a model of a reconfiguration of the distribution system, which is composed of three sections and three connections based on PSCAD/EMTDC S/W, and proposes an evaluation algorithm for the feeder reconfiguration to maximize an adaption of the PV system. In addition, this paper presents the optimal method of the feeder reconfiguration section to evaluate the maximum capacity of the PV system to keep customer voltages within the allowable voltage limits based on various operation scenarios, such as the capacity of a PV system and section of feeder reconfiguration. From the simulation results based on the PSCAD/EMTDC modeling and evaluation algorithm, it was confirmed that they are a useful and practical tool to enhance hosting the capacity of a PV system in a distribution system.

OPTIMAL FORMATION TRAJECTORY-PLANNING USING PARAMETER OPTIMIZATION TECHNIQUE

  • Lim, Hyung-Chul;Bang, Hyo-Choong;Park, Kwan-Dong;Lee, Woo-Kyoung
    • Journal of Astronomy and Space Sciences
    • /
    • v.21 no.3
    • /
    • pp.209-220
    • /
    • 2004
  • Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

Synthetically Optimal Tie Switches Selection Algorithm Considering Important Elements in Distribution Power System (배전계통 운영의 중요요소들을 고려한 상시연계점 선정 종합 최적화 알고리즘)

  • Kim, June-Ho;Lim, Hee-Taek;Yu, Nam-Cheol;Lim, Il-Hyung;Choi, Myeon-Song;Lee, Seung-Jae;Ha, Bok-Nam
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.11
    • /
    • pp.2079-2088
    • /
    • 2009
  • The optimal operation in distribution system is to select tie switches considering important elements(Load balance, Loss minimization, Voltage drop, Restoration index..) in distribution system. Optimal Tie Switches Selection is very important in operation of distribution system because that is closely related with efficiency and reliability. In this paper, a new algorithm considering important elements is proposed to find optimal location of tie switches. In the case study, the proposed algorithm has been testified using real distribution network of KEPCO for verifying algorithm and complex network for applying future distribution network.

Application of Analytic Solution in Relative Motion to Spacecraft Formation Flying in Elliptic Orbit

  • Cho, Han-Cheol;Park, Sang-Young;Choi, Kyu-Hong
    • Journal of Astronomy and Space Sciences
    • /
    • v.25 no.3
    • /
    • pp.255-266
    • /
    • 2008
  • The current paper presents application of a new analytic solution in general relative motion to spacecraft formation flying in an elliptic orbit. The calculus of variations is used to analytically find optimal trajectories and controls for the given problem. The inverse of the fundamental matrix associated with the dynamic equations is not required for the solution in the current study. It is verified that the optimal thrust vector is a function of the fundamental matrix of the given state equations. The cost function and the state vector during the reconfiguration can be analytically obtained as well. The results predict the form of optimal solutions in advance without having to solve the problem. Numerical simulation shows the brevity and the accuracy of the general analytic solutions developed in the current paper.

The Development of Application Programs for Optimal Feeder Operation Through Distribution Automatic System

  • Ha, Bok-Nam;Seol, Ieel-Ho;Jeong, Mi-Ae
    • KIEE International Transactions on Power Engineering
    • /
    • v.4A no.1
    • /
    • pp.42-47
    • /
    • 2004
  • This paper presents the various application programs for the Distribution Automation System (DAS) of the Korea Electric Power Corporation (KEPCO)'s distribution system. These programs are developed to allow for optimal operation in the areas of feeder automation, relay coordination, loss minimization and so on. They are single line diagram auto creation programs for the feeder, service restoration program, protection coordination program, data error detection program, and optimal network reconfiguration program. The details of these programs are presented for validity and effectiveness.

Task based design of modular robot manipulator using efficient genetic algorithms

  • Han, Jeongheon;Chung, Wankyun;Youm, Youngil;Kim, Seungho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.243-246
    • /
    • 1996
  • Modular robot manipulator is a robotic system assembled from discrete joints and links into one of many possible manipulator configurations. This paper describes the design method of newly developed modular robot manipulator and the methodology of a task based reconfiguration of it. New locking mechanism is proposed and it provides quick coupling and decoupling. A parallel connection method is devised and it makes modular robot manipulator working well and the number of components on each module reduced. To automatically determine a sufficient or optimal arrangement of the modules for a given task, we also devise an algorithm that automatically generates forward and inverse manipulator kinematics, and we propose an algorithm which maps task specifications to the optimized manipulator configurations. Efficient genetic algorithms are generated and used to search for a optimal manipulator from task specifications. A few of design examples are shown.

  • PDF

An Alternative Approach to Optimal Impulsive-Thrust Formation Reconfigurations in a Near-Circular-Orbit

  • Kim, Youngkwang;Park, Sang-Young;Park, Chandoek
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.2
    • /
    • pp.160.1-160.1
    • /
    • 2012
  • We present an alternative approach for satellite formation reconfiguration by an optimal impulsive-thrust strategy to minimize the total characteristic velocity in a near-circular-orbit. Linear transformation decouples the Hill-Clohessy-Wiltshire(HCW) dynamics into a new block-diagonal system matrix consisting of 1-dimensional harmonic oscillator and 2-dimensional subsystem. In contrast to a solution based on the conventional primer vector theory, the optimal solution and the necessary conditions are represented as times and directions of impulses. New analytical expression of the total characteristic velocity is found for each sub systems under general boundary conditions including transfer time constraint. To minimize the total characteristic velocity, necessary conditions for times and directions of impulses are analytically solved. While the solution to the 1-dimensional harmonic oscillator has been found, the solution to the 2-dimensional subsystem is currently under construction. Our approach is expected to be applicable to more challenging problems.

  • PDF

Efficient Logical Topology Design Considering Multiperiod Traffic in IP-over-WDM Networks

  • Li, Bingbing;Kim, Young-Chon
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.13-21
    • /
    • 2015
  • In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

Enhancing the Robustness and Efficiency of Scale-free Network with Limited Link Addition

  • Li, Li;Jia, Qing-Shan;Guan, Xiaohong;Wang, Hengtao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1333-1353
    • /
    • 2012
  • The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reconfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential configuration node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.