• Journal of the Korean Operations Research and Management Science Society
• /
• 제20권1호
• /
• pp.1-10
• /
• 1995

The purpose of this paper is to develop a method of the sensitivity analysis that can be applied to a non-tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1a is the well known method applicable to a tree solution. However this method can not be applied to a non-tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient we present a method that the sensitivity analysis of Type 2 is solved by finding the shortest path. Besides we also show that the results of Type 2 and Type 1 are the same in a spanning tree solution. For the right-hand side constant or the capacity, the sensitivity analysis of Type 2 is solved by a simple calculation using arcs with intermediate values.

• IE interfaces
• /
• 제7권3호
• /
• pp.193-199
• /
• 1994

The purpose of this paper is to develop a method of the sensitivity analysis that can be applicable to a degenerate tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1 is the well known method applicable to a spanning tree solution. However, this method have some difficulties in case of being applied to a degenerate tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds remaining at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient, we present a method that the sensitivity analysis of Type 2 is solved by using the method of a sensitivity analysis of Type 1. Besides we also show that the results of sensitivity analysis of Type 2 are union set of those of Type 1 sensitivity analysis. For the right-hand side constant or the capacity, we present a simple method for the sensitivity analysis of Type 2 which uses arcs with intermediate values.

• IE interfaces
• /
• 제10권3호
• /
• pp.179-187
• /
• 1997

The efficiency of material flow systems in terms of optimal network flow and minimum cost flow has always been an important design and operational goal in material handling and distribution system. In this research, an attempt was made to develop a new algorithm and the model to solve a stochastic material flow network with bidirectional and uncertain flows. A stochastic material flow network with bidirectional flows can be considered from a finite set with unknown demand probabilities of each node. This problem can be formulated as a special case of a two-stage linear programming problem which can be converted into an equivalent linear program. To find the optimal solution of proposed stochastic material flow network, some terminologies and algorithms together with theories are developed based on the partitioning and subgradient techniques. A computer program applying the proposed method was developed and was applied to various problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제22권2호
• /
• pp.13-29
• /
• 1997

This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.
ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• 제14권6호
• /
• pp.1375-1383
• /
• 1994

The water distribution system problem consists of finding a minimum cost system design subject to hydraulic and operational constraints. Since the municipal water distribution system problem is nonconvex with multiple local minima, classical optimization methods find a local optimum. An outer flow search - inner optimization procedure is proposed for choosing a better local minimum for the water distribution systems. The pipe network is judiciously subjected to the outer search scheme which chooses alternative flow configurations to find an optimal flow division among pipes. Because the problem is nonconvex, a global search scheme called Stochastic Probing method is employed to permit a local optimum seeking method to migrate among various local minima. A local minimizer is employed for the design of least cost diameters for pipes in the network. The algorithm can also be employed for optimal design of parallel expansion of existing networks. In this paper one municipal water distribution system is considered. The optimal solutions thus found have significantly smaller costs than the ones reported previously by other researchers.

• Journal of Environmental Science International
• /
• 제26권9호
• /
• pp.1031-1043
• /
• 2017

Recently severe drought caused the water shortage around the western parts of Chungcheongnamdo province, South Korea. A Diversion tunnel from the Geum river to the Boryong dam, which is the water supply dam for these areas has been proposed to solve this problem. This study examined hydraulic impacts on the Geum river associated with the diversion plan assuming the severe drought condition of 2015 would persist for the simulation period of 2016. The hydraulic simulation model was verified using hydrologic and hydraulic data including hourly discharges of the Geum river and its 8 tributaries, fluctuation of tidal level at the mouth of the river, withdrawals and return flows and operation records of the Geum river barrage since Feb. 1, 2015 through May 31, 2015. For the upstream boundary condition of the Geum river predicted inflow series using the nonlinear regression equation for 2015 discharge data was used. In order to estimate the effects of uncertainty in inflow prediction to the results total four inflow series consisting of upper limit flow, expected flow, lower limit flow and instream flow were used to examine hydraulic impacts of the diversion plan. The simulation showed that in cases of upper limit and expected flows there would be no problem in taking water from the Geum river mouth with a minimum water surface level of EL(+) 1.44 m. Meanwhile, the simulation also showed that in cases of lower limit flow and instream flow there would be some problems not only in taking water for water supply from the mouth of the Geum river but also operating the diversion facility itself with minimum water surface levels of EL(+) 0.94, 0.72, 0.43, and 0.14 m for the lower limit flow without/with diversion and the instream flow without/with diversion, respectively.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• 제50권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.

• Journal of Electrical Engineering and Technology
• /
• 제12권6호
• /
• pp.2187-2195
• /
• 2017

In order to solve the AC optimal power flow (OPF) problem considering the generators' on/off status, it is necessary to model the problem as mixed-integer nonlinear programming (MINLP). Because the computation time to find the optimal solution to the mixed-integer AC OPF problem increases significantly as the system becomes larger, most of the existing solutions simplify the problem either by deciding the on/off status of generators using a separate unit commitment algorithm or by ignoring the minimum output of the generators. Even though this kind of simplification may make the overall computation time tractable, the results can be significantly erroneous. This paper proposes a novel algorithm for the mixed-integer AC OPF problem, which can provide a near-optimal solution quickly and efficiently. The proposed method is based on a combination of the outer approximation method and the relaxed AC OPF theory. The method is applied to a real-scale power system that has 457 generators and 2132 buses, and the result is compared to the branch-and-bound (B&B) method and the genetic algorithm. The results of the proposed method are almost identical to those of the compared methods, but computation time is significantly shorter.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2010년 춘계학술대회논문집
• /
• pp.584-585
• /
• 2010

A numerical simulation was performed to investigate the internal flow characteristics in gas turbine nozzle by the variation of flow area of the nozzle. In general the area of turbine nozzle is chosen by the most substantial factor on performance improvement of turbine at the first stage. In the performances test through CFD analysis for three types of nozzle with conventional, enlarged and reduced area, reduced one with effective flow area (EFA) was the most efficient. That is the minimum effective value within EFA limit defined by the manual of technical order had a good performance. It is useful to avoid the low power problem in the test of performance after maintenance and overhaul of turbine engine.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power 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 coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.