• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.433-436
• /
• 2002

Most of electric distribution utilities have their reliability performance measured by reliability indices such as SAIFI and SAIDI to evaluate customer satisfaction. Adding protective devices in electrical distribution system can increase the system reliability by protecting public customers from local faults. In large-scale distribution system, it is difficult to determine the positions of these protective devices, which can efficiently protect customers within utilities' investment. In this paper, we propose an optimization technique to identify types and positions of protective devices to minimize SAIFI and SAIDI indices according to system requirement constraints.

• International Journal of Advanced Culture Technology
• /
• v.8 no.2
• /
• pp.260-269
• /
• 2020

The Steam Assisted Gravity Drainage (SAGD) process is an enhanced method to extract oil from bitumen which involves surface and central process facilities. This paper describes the Central Process Facilities (CPF) of SAGD and proposes several retrofit plans to the Heat Exchanger Network (HEN). In this approach, the process integration scheme is applied to estimate the energy saving in HENs, and various cases are modeled in favor of a commercial simulator. Throughout this work, a minimum approach temperature of 10℃ is assumed. The results reveal that, due to the HEN optimization using process integration, the heating and cooling duties can be reduced to 29.68MW and 1.886MW, respectively. Compared with the Husky case, all cases considered in this study indicate a potential reduction of at least 6% in total cost, including investment and operation costs.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.2
• /
• pp.293-300
• /
• 2020

In this paper we study an optimal consumption, investment and retirement time choice problem of an investor who receives labor income before her voluntary retirement. And we assume that there is a negative wealth constraint which is a general version of borrowing constraint. Using convex-duality method, we provide the closed-form solutions of the optimization problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.2
• /
• pp.1-17
• /
• 2015

In this paper, we propose a portfolio selection model utilizing a Markov chain for investing in the foreign exchange market based on market forecasts and exchange rate movement predictions. The proposed model is utilized to compute optimum investment portfolio weights for investing in margin-based markets such as the FX margin market. We further present an objective investment algorithm for applying the proposed model in real-life investments. Empirical performance of the proposed model and investment algorithm is evaluated by conducting an experiment in the FX market consisting of the 7 most traded currency pairs, for a period of 9 years, from the beginning of 2005 to the end of 2013. We compare performance with 1) the Dollar Index, 2) a 1/N Portfolio that invests the equal amount in the N target assets, and 3) the Barclay BTOP FX Index. Performance is compared in terms of cumulated returns and Sharpe ratios. The results suggest that the proposed model outperforms all benchmarks during the period of our experiment, for both performance measures. Even when compared in terms of pre- and post-financial crisis, the proposed model outperformed all other benchmarks, showing that the model based on objective data and mathematical optimization achieves superior performance empirically.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1758-1761
• /
• 1997

The problem of long range capacity expansion planing for chemical processing network under uncertain demand forecast secnarios is addressed. This optimization problem involves capactiy expansion timing and sizing of each chemical processing unit to maximize the expected net present value considering the deviation of net present values and the excess capacity over a given time horizon. A multiperiod mixed integer nonlinear programming optimization model that is both solution and modle robust for any realization of demand scenarios is developed using the two-stage stochastic programming algorithm. Two example problems are considered to illustrate the effectiveness of the model.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.369-374
• /
• 2008

This paper presents the evaluation procedures and the estimation method for the estimation of optimal rebate level for EE(Energy Efficiency) programs. The penetration amount of each appliance is estimated by applying price function to preferred diffusion model resulted from model compatibility test. To estimate the optimal rebate level, two objective functions which express the maximum energy saving and operation benefit are introduced and by multi-objective function which can simultaneously consider two objective functions the optimal rebate level of each appliance is estimated. And then, using the decided rebate level and each penetration amount, the priority order for reasonable investment of each high-efficiency appliance is estimated compared to the results of conventional method. Finally, using a benefit/cost analysis based on California standard practice manual, the economic analysis is implemented for the four perspectives such as participant, ratepayer impact measure, program administrator cost and total resource cost.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.142-146
• /
• 2000

This paper Presents a heuristic algorithm based on branch exchange method to solve ORP (Optimal Routing Problem) for distribution system planning. The ORP is a complex task which is generally formulated as a combinatorial optimization problem with various constraints. The cost function of ORP is consisted of the investment cost and the system operation cost that is generally expressed with system power loss. This paper also adopt an specialy designed selection method of maximum loss reduction loop and branch to reduce optimization time. The effectiveness of the proposed algorithm was shown with 32, 69 bus example system.

• Proceedings of the KIEE Conference
• /
• 1997.07c
• /
• pp.1044-1047
• /
• 1997

This paper presents development of practical and universal program that is applied to ${\pi}$ loop system which is based on basic algorithm of network optimization for reduction investment cost and rationalization of underground plan. This system is ease to input and modify about information of powerline drawing, that is, can input easily condition of their calculation referring to candidate of underground apparatus under using digitizer.

• Journal of the Korea Safety Management & Science
• /
• v.17 no.4
• /
• pp.259-273
• /
• 2015

CIS nations are recognized as an emerging market recently because there are abundant natural resources and a lot of investment demand. Furthermore, they are located in the middle of Europe and Asia and that make them have more strategic importance as a logistics hub. So many global companies including domestic ones began to advance into the on-site. and this tendency will be strong. On the contrary, a research in logistics environment of CIS has rarely been done. This paper provides a way of systematic approach to design logistics network in CIS with real business case and shows the analyzed result of optimization simulation that includes factors having a huge influence on the overall logistics cost.

• IE interfaces
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2008

In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.