• Title/Summary/Keyword: Minimum Cost Flow

Search Result 88, Processing Time 0.02 seconds

A study on the traffic analysis of RIP and EIGRP for the most suitable routing (최적의 라우팅을 위한 RIP와 EIGRP 트래픽 분석 연구)

  • 이재완;고남영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.36-40
    • /
    • 2002
  • Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.

Optimal Long-term Transmission Planning Algorithm using Non-linear Branch-and-bound Method (비선형 분산안전법을 이용한 최적장기송전계률 알고리)

  • 박영문;신중린
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.5
    • /
    • pp.272-281
    • /
    • 1988
  • The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

A Low Power-Driven Data Path Optimization based on Minimizing Switching Activity (스위칭 동작 최소화를 통한 저전력 데이터 경로 최적화)

  • 임세진;조준동
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.4
    • /
    • pp.17-29
    • /
    • 1999
  • This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

  • PDF

A feasibility study of interconnection between ROK and Russia (남한-러시아 국가간 계통연계를 위한 예비 타당성 검토)

  • Kim, Jong-Yul;Lee, Seong-Ryul;Yoon, Jae-Young
    • Proceedings of the KIEE Conference
    • /
    • 2005.11b
    • /
    • pp.356-358
    • /
    • 2005
  • This paper evaluates minimum and maximum power exchange considering economic and technical characteristics between Russia and ROK. First, we evaluate minimum power exchange to assure the economic feasibility by comparison with the total cost and benefit of the interconnected line. For evaluating maximum exchange power, system constraints are considered, which are examined through load flow and dynamic analysis by using the PSS/E program. As a result of these evaluations, we suggest the reasonable range of power exchange between ROK and Russia considering economic and technical constraints with the interconnection scenario that power system interconnection between ROK and Russia will be realized in the year 2010.

  • PDF

Feasible Power Exchange between Russia and ROK Power Systems

  • Kim Jong-Yul;Lee Seung-Ryul;Yoon Jae-Young;Kim Ho-Yong
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.221-227
    • /
    • 2005
  • This paper evaluates minimum and maximum power exchange considering economic and technical characteristics between Russia and ROK. First, we evaluate minimum power exchange to assure the economic feasibility by comparison with the total cost and benefit of the interconnected line. For evaluating maximum exchange power, system constraints are considered, which are examined through load flow and dynamic analysis by using the PSS/E program. As a result of these evaluations, we suggest the reasonable range of power exchange between ROK and Russia considering economic and technical constraints with the interconnection scenario that power system interconnection between ROK and Russia will be realized in the year 2010.

A Multi-level Optimal Power Flow Algorithm for Constrained Power Economic Dispatch Control (제약조건을 고려한 경제급전 제어를 위한 다단계 최적조류계산 알고리즘)

  • Song, Gyeong-Bin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.9
    • /
    • pp.424-430
    • /
    • 2001
  • A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

  • PDF

Optimal Shunt Compensation for Improving Voltage Stability and Transfer Capability in Metropolitan Area of the Korean Power System

  • Choi, YunHyuk;Lee, Byongjun;Kim, TaeKyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1502-1507
    • /
    • 2015
  • This paper deals with shunt compensation to eliminate voltage violation and enhance transfer capability, which is motivated towards implementation in the Korean power system. The optimal shunt compensation algorithm has demonstrated its effectiveness in terms of voltage accuracy and reducing the number of actions of reactive power compensating devices. The main shunt compensation devices are capacitor and reactor. Effects of control devices are evaluated by cost computations. The control objective at present is to keep the voltage profile of a key bus within constraints with minimum switching cost. A robust control strategy is proposed to make the control feasible and optimal for a set of power-flow cases that may occurs important event from system. Case studies with metropolitan area of the Korean power system are presented to illustrate the method.

Optimal Scheduling in Power-Generation Systems with Thermal and Pumped-Storage Hydroelectric Units

  • Kim, Sehun;Rhee, Minho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.1
    • /
    • pp.99-115
    • /
    • 1990
  • This paper is concerned with the unit commitment problem in an electric power system with both thermal and pumped-storage hydroelectric units. This is a mixed integer programming problem and the Lagrangean relaxation method is used. We show that the relaxed problem decomposes into two kinds of subproblems : a shortest-path problem for each thermal unit and a minimum cost flow problem for each pumped-storage hydroelectric unit. A method of obtaining an incumbenet solution from the solution of a relaxed problem is presented. The Lagrangean multipliers are updated using both subgradient and incremental cost. The algorithm is applied to a real Korean power generation system and its computational results are reported and compaired with other works.

  • PDF

An empirical study on the material distribution decision making

  • Ko, Je-Suk
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.2
    • /
    • pp.355-361
    • /
    • 2010
  • This paper addresses a mathematical approach to decision making in a real-world material distribution situation. The problem is characterized by a low-volume and highly-varied mix of products, therefore there is a lot of material movement between the facilities. This study focuses especially on the transportation scheduler with a tool that can be used to quantitatively analyze the volume of material moved, the type of truck to be used, production schedules, and due dates. In this research, we have developed a mixed integer programming problem using the minimum cost, multiperiod, multi-commodity network flow approach that minimizes the overall material movement costs. The results suggest that the optimization approach provides a set of feasible solution routes with the objective of reducing the overall fleet cost.

A Study on Voltage and Reactive Power Control Methodology using Integer Programming and Local Subsystem (지역 계통 구성과 Integer programming을 이용한 전압 및 무효전력 제어방안 연구)

  • Kim, Tae-Kyun;Choi, Yun-Hyuk;Seo, Sang-Soo;Lee, Byong-Jun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.543-550
    • /
    • 2008
  • This paper proposes an voltage and reactive power control methodology, which is motivated towards implementation in the korea power system. The main voltage control devices are capacitor banks, reactor banks and LTC transformers. Effects of control devices are evaluated by local subsystem's cost computations. This local subsystem is decided by 'Tier' and 'Electrical distance' in the whole system. The control objective at present is to keep the voltage profile within constraints with minimum switching cost. A robust control strategy is proposed to make the control feasible and optimal for a set of power-flow cases that may occur important event from system. This studies conducted for IEEE 39-bus low and high voltage contingency cases indicate that the proposed control methodology is much more effective than PSS/E simulation tool in deciding switching of capacitor and reactor banks.