• Title/Summary/Keyword: Optimal line

Search Result 1,483, Processing Time 0.027 seconds

A study of Optimal Reconfiguration in Distribution Power System using Initial Operating Point (초기 운전점 선정을 통한 배전계통 최적 재구성에 관한 연구)

  • Seo, Gyu-Seok;Kim, Jung-Nyun;Baek, Young-Sik
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.3
    • /
    • pp.451-456
    • /
    • 2007
  • This paper presents a problem that reconfigure distribution power system using branch exchange method. Optimal reconfiguration problem calculates line loss, voltage condition about system states of all situations that become different according to line On/off status, and search for optimum composition of these. However, result is difficult to be calculated fast. Because radiated operation condition of system is satisfied using many connection and sectionalize switches in the distribution power system. Therefore, in this paper, optimization method for reducing system total loss and satisfying operating condition of radial and constraints condition of voltage is proposed using the fastest branch exchange. And optimal solution at branch exchange algorithm can be wrong estimated to local optimal solution according to initial operating state. Considering this particular, an initial operating point algorithm is added and this paper showed that optimal solution arrives at global optimal solution.

A New Optimal AVR Parameter Tuning Method Using On-Line Excitation Control System Model with SQP Method (온라인 여자제어시스템 모델과 SQP법을 이용한 AVR의 파라미터 튜닝 방법에 관한 연구)

  • Kim, Jung-Mun;Mun, Seung-Il
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.3
    • /
    • pp.118-126
    • /
    • 2002
  • AVR parameter tuning for voltage control of generators has generally been done with the off-line open-circuit model of the synchronous generator. When the generator is connected on-line and operating with load the AVR operates in an entirely different environment from the open-circuit conditions. This paper describes a new method for AVR parameter tuning for on line conditions using SQP(Sequential Quadratic Programming) meshed with frequency response characteristics of linearized on-line system model. As the proposed method uses the un - line system model the tuned parameter sets show more optimal behavior in the on-line operating conditions. furthermore, as this method considers the performance indices that are needed for stable operation as constraints, AVR parameter sets that are tuned by this method could guarantee the stable performance, too.

Optimal Inspection Plan for a Flexible Assembly Line

  • Yoo, Seuck-Cheun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.97-117
    • /
    • 1993
  • This paper considers inspection station location problem for a flexible assembly line that consists of multiple stages. By considering the trade-off between locating an station at an "early" stage and at a "late" stage, we have developed some dominance relations on a graph. Based on the dominance relations, we then present an algorithm that finds an optimal inspection plan and a heuristic approach that finds a near-optimal inspection plan. The effectiveness of these two algorithms is demonstrated by two numerical examples. numerical examples.

  • PDF

Robust Constrained Predictive Control without On-line Optimizations

  • Lee, Y. I.;B. Kouvaritakis
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.27.4-27
    • /
    • 2001
  • A stabilizing control method for linear systems with model uncertainties and hard input constraints is developed, which does not require on-line optimizations. This work is motivated by the constrained robust MPC(CRMPC) approach [3] which adopts the dual mode prediction strategy (i.e. free control moves and invariant set) and minimizes a worst case performance criterion. Based on the observation that, a feasible control sequence for a particular state can be found as a linear combination of feasible sequences for other states, we suggest a stabilizing control algorithm providing sub-optimal and feasible control sequences using pre-computed optimal sequences for some canonical states. The on-line computation of the proposed method reduces to simple matrix multiplication.

  • PDF

The Study for Optimal Layout of the Eleutherococcus Senticosus Sap Production Line Analyzed by Simulation Model (시뮬레이션 모델 구축과 분석을 통한 가시오가피 액즙 가공 라인의 최적 배치에 관한 연구)

  • Kim, Young-Jin;Park, Hyun-Joon;Mun, Joung-Hwan
    • Journal of Biosystems Engineering
    • /
    • v.36 no.6
    • /
    • pp.461-466
    • /
    • 2011
  • The purpose of this study is basically for the use of simulations to enhance productivity. In this paper, the optimal number of allocation in a small and medium industry which produces eleutherococcus senticosus sap, is performed using simulations. The simulation model was developed under considerations of production layout, process & operation, process time, total work time, work in process (WIP), utilization, failure rate, and operation efficient as inputs, and was validated with careful comparisons between real behaviors and outputs of the production line. Therefore, we can evaluate effects and changes in productivity when some strategies and/or crucial factors are changed. Although too many workers and machines could decrease productivity, the eleutherococcus senticosus sap production line in this paper has been maintained many machines. To solve this problem, we determined the optimal number of workers and machines that could not cause any interrupt in productions using simulations. This simulation model considers diverse input variables which could influence productivity, and it is very useful not only for the production line of Eleutherococcus Senticosus Sap, but also for other production lines with various purposes, especially, in the small and medium industries.

Self-tuning optimal control of an active suspension using a neural network

  • Lee, Byung-Yun;Kim, Wan-Il;Won, Sangchul
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.295-298
    • /
    • 1996
  • In this paper, a self-tuning optimal control algorithm is proposed to retain the optimal performance of an active suspension system, when the vehicle has some time varying parameters and parameter uncertainties. We consider a 2 DOF time-varying quarter car model which has the parameter variation of sprung mass, suspension spring constant and suspension damping constant. Instead of solving algebraic riccati equation on line, we propose a neural network approach as an alternative. The optimal feedback gains obtained from the off line computation, according to parameter variations, are used as the neural network training data. When the active suspension system is on, the parameters are identified by the recursive least square method and the trained neural network controller designer finds the proper optimal feedback gains. The simulation results are represented and discussed.

  • PDF

On-Line Scheduling Method for Track Systems in Semiconductor Fabrication (반도체 제조 트랙장비의 온라인 스케줄링 방법)

  • Yun, Hyeon-Jung;Lee, Du-Yong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.3
    • /
    • pp.443-451
    • /
    • 2001
  • This paper addresses an on-line scheduling method for track systems in semiconductor fabrication. A track system is a clustered equipment performing photolithography process in semiconductor fabrication. Trends toward high automation and flexibility in the track systems accelerate the necessity of the intelligent controller that can guarantee reliability and optimize productivity of the track systems. This paper proposes an-efficient on-line scheduling method that can avoid deadlock inherent to track systems and optimize the productivity. We employ two procedures for the on-line scheduling. First, we define potential deadlock set to apply deadlock avoidance policy efficiently. After introducing the potential deadlock set, we propose a deadlock avoidance policy using an on-line Gantt chart, which can generate optimal near-optimal schedule without deadlock. The proposed on-line scheduling method is shown to be efficient in handling deadlock inherent to the track systems through simulation.

Buffer Management Algorithms in Unbounded Buffers

  • Kim, Jae-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.721-724
    • /
    • 2010
  • In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

Partial Inverse Traveling Salesman Problems on the Line

  • Chung, Yerim;Park, Myoung-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.11
    • /
    • pp.119-126
    • /
    • 2019
  • The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.

The Effectiveness of Weaving Motion and Determination of Optimal Heating Condition in Line-heating (선상가열시 위빙방식의 효율성과 최적 가열조건 결정에 관한 연구)

  • 하윤석;장창두
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.41 no.4
    • /
    • pp.68-76
    • /
    • 2004
  • Inherent strain method for analyzing deformation of line-heating is substituting experiments of high cost, because of its high accuracy and quickness. Nowadays, the progressing forms of line-heating are not straight moving motions used to traditional studies, but weaving motions which can diversely input heat source. In shipyard, reasons of weaving motions are induction of a special characteristic by water cooling, maximum temperature limitation for keeping plates from melting, and rhythm for workman's maintaining velocity. On this study, a method which can obtain optimal weaving heating condition was presented, some examples were introduced, and the results corresponded to works of shipyard. Lastly, what the specifications of plates on efficiency are is presented, through the quality standard of shipyard and FEM heat transfer simulation. The ultimate purpose of line heating is the automation, so in case of plates which need weaving heating, the optimal heating condition suggested by this study can be used well in designing coil specifications of induction heaters which are heat input sources of new generation.