• 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.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• 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.

• Journal of Yeungnam Medical Science
• /
• v.23 no.1
• /
• pp.10-18
• /
• 2006

Epithelial to mesenchymal transition (EMT) is an important etiologic factor for the development of peritoneal fibrosis in CAPD patients. Mesothelial cells are main source of trans-differentiated fibroblasts under stress from the bioincompatible peritoneal dialysate. In our study there was no difference in dialysate TGF-${\beta}$ and VEGF between the low and high GDP groups during an initial 12 months. However, after adjusting with D-CA125, the low GDPs group showed a significantly lower D-TGF-${\beta}$/D-CA125 and D-VEGF/CA125 during the initial 12 months. Among the adjusted peritoneal growth factors for CA125, VEGF/CA125 and TGF-b/CA125 were factors significantly associated with greater EMT in this study. Adjustment of the peritoneal growth factor for effluent CA125 (surrogate for mass of HPMCs) revealed significant association with EMT suggesting that the fibroblastoid transition from HPMCs could be affected by the amount of intraperitoneal growth factors (TGF-b, VEGF) per unit mass of HPMCs. There was significant improvement in both cell score and D-CA125 at the sixth and 12th months after switching from a high GDPs solution to a low GDPs solution. Use of icodextrin solution in patients who had average peritoneal transport showed not only better systemic effects such as decreased glucose absorption via dialysate but also preservation of the peritoneum, including less EMT and high mesothelial bulk mass. In conclusion, Therapy with low GDP solution including icodextrin may positively impact preservation of the peritoneal membrane integrity and prevention of peritoneal fibrosis with time on PD.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.189-195
• /
• 2021

This paper discusses choice of loans problem(CLP) that is to minimize annual payment from which bank's borrows in multi-banks multi-nations with distinct interests. For the CLP, there is impossible to obtain the optimal solution actually without the help of mathematical software package as linear programming(LP). This paper applies the method used in transportation problem(TP) that finds initial feasible solution with selects minimum interest first, least cost method(LCM), to CLP. Result of experiment, the proposed algorithm can be obtains the optimal solution with at most two exchange optimization for LCM's initial feasible solution.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• Journal of Soil and Groundwater Environment
• /
• v.19 no.6
• /
• pp.37-48
• /
• 2014

Lab scale rhizofiltration by using four plants was performed to investigate the uranium removal efficiency from groundwater. Lettuce (Lactuca sativa L.), Chinese cabbage (Brassica campestris L.), radish sprouts (Raphanus sativus L.) and buttercup (Oenanthe javanica) were cultivated during 3 weeks in the phytotron. Glass jar ($12cm{\times}12cm{\times}8cm$ for each), containing 350 ml of the artificially uranium contaminated solution was used for 72 hours of the rhizofiltration. In experiments with different initial uranium concentration ($18.00{\mu}g/L$, $31.00{\mu}g/L$, $84.00{\mu}g/L$ and $116.00{\mu}g/L$) in solution, more than 70% of the initial uranium were removed by using lettuce, Chinese cabbage and radish sprouts and the residual uranium concentration in solution maintained lower than USEPA water tolerance limit ($30{\mu}g/L$). From the rhizofiltration experiments at various pH conditions, the highest uranium removal for all four plants was acquired at pH 3 in solution. Rhizofiltration experiments testing two field samples of groundwaters having high uranium concentrations ($86.00{\mu}g/L$ and $173.00{\mu}g/L$) were duplicated and more than 83% of the initial uranium were removed from the groundwater within 72 hours of rhizofiltration by using radish sprouts, which, suggests that the rhizofiltration can be a useful process to remediate uranium contaminated groundwater in the field. After the rhizofiltration experiment, the SEM and EDS analyses for the root surface of the radish sprouts were conducted, suggesting that the main mechanism of the rhizofiltration for the removal of uranium from groundwater would be surface precipitation on the root surface of the plant.

• Kyungpook Mathematical Journal
• /
• v.60 no.2
• /
• pp.401-413
• /
• 2020

In this article we consider the following system of piecewise linear difference equations: x_n+1 = |x_n| - y_n - 1 and y_n+1 = x_n + |y_n| - 1. We show that when the initial condition is an element of the closed second or fourth quadrant the solution to the system is either a prime period-3 solution or one of two prime period-4 solutions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.216-219
• /
• 1998

This study proposes JPT(Job-Pair Tardiness) that choose operation to be expected to generate better schedule consequence in comparing schedulable operation sets in pair to minimize total tardiness evaluation function in performing scheduling. In result of comparison with existing assignment rules. JPT generates better solution than most other rules in all kinds of problems. So it is anticipated that this is used for initial solution of heuristic and is used for finding more improved solution.

• Journal of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.327-342
• /
• 2018

In this paper, a homotopy continuation method for obtaining the unique Hermitian positive definite solution of the nonlinear matrix equation $X-{\sum_{i=1}^{m}}A^{\ast}_iX^{-p_i}A_i=I$ with $p_i$ > 1 is proposed, which does not depend on a good initial approximation to the solution of matrix equation.