• 대한전기학회논문지:전력기술부문A
• /
• 제55권10호
• /
• pp.426-432
• /
• 2006

This paper describes the concepts of Static Line Rating (SLR) and Dynamic Line Rating (DLR) and the computational methods to demonstrate them. Calculation of the line capacity needs the heat balance equation which is also used for computing the reduced tension in terms of line aging. SLR is calculated with the data from the worst condition of weather throughout the year. Even now, the utilization ratio is obtained from this SLR data in Korea. DLR is the improved method compared to SLR. A process for DLR reveals not only improved line ratings but also more accurate allowed line ratings based on line aging and real time conditions of weather. In order to reflect overhead transmission line aging in DLR, this paper proposes the method that considers the amount of decreased tension since the lines have been installed. Therefore, the continuous allowed temperature for remaining life time is newly acquired. In order to forecast DLR, this paper uses weather forecast models, and applies the concept of Thermal Overload Risk Probability (TORP). Then, the new concept of Dynamic Utilization Ratio (DUR) is defined, replacing Static Utilization Ratio (SUR). For the case study, the two main transmission lines which are responsible for the north bound power flow in the Seoul metropolitan area are chosen for computing line rating and utilization ratio. And then line rating and utilization ratio are analyzed for each transmission line, so that comparison of the present and estimated utilization ratios becomes available. Finally, this paper proves the validity of predictive DUR as the objective index, with simulations of emergency state caused by system outages, overload and so on.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.64-71
• /
• 2015

In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ${\cdots}$, m. The total production time for periods from 1 to i is given by $b_i$ for each i = 1, ${\cdots}$, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[$O(n^2logn)$, $O(mn^2)$] where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

• 한국인터넷방송통신학회논문지
• /
• 제23권6호
• /
• pp.125-132
• /
• 2023

본 논문은 NP-완전으로 알려진 k-SAT 문제의 절의 수 m에 대해 O(km)의 다항시간 알고리즘을 제안하였다. 기존에 널리 알려진 DPLL은 문자 수 𝑙에 대해 분기한정법의 전수탐색으로 해를 찾지 못하면 역추적을 수행하는 방식으로 최악의 경우 O(2^𝑙)을 수행해야 한다. DPLL은 최소 빈도수 문자가 포함된 절을 참(T)으로 하도록 문자에 참(T) 또는 거짓(F)을 대입하여 해당 문자가 포함된 절을 제거하는 방식으로 SAT Solver의 근간을 이루고 있다. 제안된 알고리즘은 DPLL과는 반대로 부울 수식 f에 존재하는 최대 빈도수 문자 _max𝑙을 선택하고, $_{\max}({\mid}l{\mid},{\mid}{\bar{l}}{\mid})=1$로 설정하고, 𝑙∈c_i 절은 삭제하며, ${\bar{l}}{\in}c_i$절에서 ${\bar{l}}$를 삭제하는 방법을 적용하였다. 제안된 알고리즘을 다양한 k-SAT 문제들에 적용한 결과 기존의 DPLL 알고리즘보다 적은 횟수를 수행함을 알 수 있었다.