• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.311-312
• /
• 2006

본 논문에서는 선로 전력조류제약을 고려한 경제급전(SCED : Security-Constrained economic dispatch)에 내점 선형계획법을 이용하여 최적해를 구하는 문제를 다룬다. 최적전력조류(Optimal Power Flow)식으로부터 선로의 유효전력만을 근사화하여 선로 전력조류 제약을 고려할 경제급전(SCED)의 식을 정식화한다. 선형계획법을 적용하여 최적해를 구하기 위해서 발전기출력과 유효전력, 부하, 손실과의 관계를 이용하여 경제급전의 식을 선형화 하는 알고리즘을 제시한다. 선형화 알고리즘은 목적함수로 계통 발전기의 총 연료비를 취하고 전력수급평형식으로 발전기출력증분에 대한 선로의 증분손실계수를 이용하며, 선로의 제약조건은 일반화발전 분배계수(GGDF : Generalized Generation Distribution Factor)를 이용하여 선형화한다. 최적화 기법으로서 내점법(Interior Point Method)을 적용하고자 하며 사례연구를 통하여 선형계획법 중 가장 많이 사용하는 심플렉스(Simplex)법과의 수렴특성을 비교하여 내점 법의 효용성을 확인하고자 한다.

• Proceedings of the KIPE Conference
• /
• 2019.11a
• /
• pp.208-209
• /
• 2019

본 논문에서는 ESS를 이용한 전력 계통의 Peak-Shaving 제어 알고리즘 수립에 대한 연구 결과를 제시한다. 과거의 요일별 전력수요 데이터를 이용하는 경우 ESS가 포함된 전력 시스템의 연결점(PCC)에서 전력 및 에너지 평형 방정식을 수립할 수 있고, ESS의 전력 및 에너지 용량에 따른 전기요금 최소화를 목적 함수로 한 선형 계획법 문제를 정식화할 수 있다. 선형 계획법 문제 해결을 통해 ESS가 추가되는 경우에 대한 경제성을 분석할 수 있고, 이로부터 ESS의 적합한 용량도 선정할 수 있다. 또한 부하 크기 및 시간대별 ESS 최적 전력 이용 패턴을 확인할 수 있기 때문에 실 운용 로직 설계를 위한 가이드로 결과를 활용할 수 있다. 본 논문에서는 제안된 방법을 설명하기 위한 일 예시로서, 시간대별 전력 부하 패턴의 기존 연구 결과로부터 도출한 부하 전력 곡선을 이용하여 선형 계획법을 이용한 Peak-Shaving 최적 제어 결과를 제시하고, 이를 기반으로 실시간 운전 가능한 규칙 기반 알고리즘을 설계하여 ESS의 적용에 따른 요금 절감 효과를 제시한다.

• Water for future
• /
• v.27 no.3
• /
• pp.135-143
• /
• 1994

This paper presents a model for the optimal design of dendritic water distribution systems using linear progranning technique. The optimization model was formulated and applied to a coastal region reclamation project site located in Hae-Ham, Jun-Nam province. The water distribution systems in the region had aleady been designed using a hydraulic simulator(BRANCH). The optimization model developed in this research utilized the data given in the report of the project. The comparison between the systems designed by the simulator and by the optimization model shows that the optimization model provides better results and can be utilized more efficiently in the design of dendritic water distribution systems.

• KDI Journal of Economic Policy
• /
• v.3 no.2
• /
• pp.171-189
• /
• 1981

• Journal of the Korean Society for Railway
• /
• v.17 no.2
• /
• pp.140-147
• /
• 2014

Line planning is an important step to determine the optimal frequencies of trains given the forecasted demand for each train type. The main input data for line planning is the leg traffic demand which can be derived using suitable traffic assignment models. However most assignment models require a line plan, in other words, train frequencies or headways, so that inconsistent results just by the procedural approach to find an optimal line plan after determining leg traffic can be avoided. This paper suggests a unified model that can consider the traffic assignment and line planning, simultaneously. We further provide an elaborated approximation algorithm and, finally, provide experimental results determined for the Korean railway network.

• Magazine of korean Tunnelling and Underground Space Association
• /
• v.14 no.6
• /
• pp.12-18
• /
• 2012

• Journal of Korean Society of Forest Science
• /
• v.89 no.3
• /
• pp.335-341
• /
• 2000

In this study, the multiobjective linear programming (MOLP) formulation was built to solve for the optimal forest management planning considering carbon sequestration and timber production simultaneously. The formulation was applied to a case study problem to investigate the trends of the optimal forest harvest schedules as the function of preference of forest management for carbon sequestration and timber production. The study site was Mt. Kari area in Hongchun. The formulation includes several site-specific constraints for non-declining yields, upper and lower bounds of cut volume and area for timber, ending inventory conditions, etc.. According to the changes of weight combinations for timber production and carbon sequestration, the joint production possibilities curve was proposed as the option for management choice.

• Journal of Korea Water Resources Association
• /
• v.52 no.8
• /
• pp.565-573
• /
• 2019

An optimization model of water intake planning is developed based on a linear programming (LP) for the intelligent water purification plant operation system. The proposed optimization model minimizes the water treatment costs of raw water purification by considering a time-delay of treatment process and hourly electricity tariff, which is subject to various operation constraints, such as water intake limit, storage tank capacity, and water demand forecasts. For demonstration, the developed model is applied to H water purification center. Here, we have tested three optimization strategies and the results are compared and analyzed in economic and safety aspects. The optimization model is expected to be used as a decision support tool for optimal water intake scheduling of domestic water purification centers.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.42 no.6
• /
• pp.837-842
• /
• 2022

The "Intelligent Railroad Alignment Design Program (ei-Rail) developed in 2013 has been adopted in the planning and the evaluation/validation of design results of oversea railroad construction projects. Target countries of Korean railroad industries requires the operating speed increase with alignment improvement and the double tracking of prevailing single track railroads as well as new railroad construction. This study is to develop an additional module for double tracking project of prevailing single track railroads in the ei-Rail. The developed method is based on the geometrics of prevailing railroad, and the definition of planned project determines the project cost based on the unit cost by work type, and provides the draft design of double track. The module was validated with a oversea case. It is then expected for oversea railroad double tracking project more efficiently in planning and the evaluation of design results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.167-173
• /
• 2023

The cash flow matching problem(CFMP) aims to minimize the initial investment by paying the total amount due for the T-year in principal and interest of bonds or bank deposits without paying the full amount in cash. Linear programming(LP) is the only known way to solve CFMP. The linear programming method is a problem that optimizes T linear functions, and it cannot be solved by handwriting, so LINGO, which is a solution to the linear programming method, is used. This paper proposes an algorithm that obtains the solution of CFMP solely by handwriting without the help of LINGO. The proposed algorithm determines the amount of bond purchases by covering payments until the previous year of the next maturity bond in the order that the maturity date falls from the longest to the short term. In addition, until the year before the maturity of the shortest maturity bond, the amount of deposit covered by the principal and interest of the bank deposit was determined. As a result of applying the proposed algorithm to two experimental data, it was shown that more accurate results can be obtained compared to the linear programming method.