• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.11
• /
• pp.566-574
• /
• 2000

This paper propose a heuristic algorithm based on the Branch-Exchange (BE) method to solve Optimal feeder Routing(OFR) problem for the distribution system planning. The cost function of the OFR problem is consisted of the investment cost representing the feeder installation and the system operation cost representing the system power loss. We propose a properly designed heuristic strategy, which can handle the horizon-year expansion planning problem of power distribution network. We also used the loop selection method which can define the maximum loss reduction in the network to reduce calculation time, and proposed a new index of power loss which is designed to estimate the power loss reduction in the BE. The proposed index, can be considered with both sides, the low voltage side and voltage side branch connected with tie one. The performances of the proposed algorithms and loss index were shown with 32, 69 example bus system.

• 한국신재생에너지학회:학술대회논문집
• /
• 2008.05a
• /
• pp.303-306
• /
• 2008

The wind power generation systems have a fluctuating or intermittent power output due to the variability of the wind speed. The amount of wind generation which can be connected to the grid without causing voltage stability problems is limited. In this study, the simulation of the wind power generation including energy storage system were performed to reduce the fluctuation of wind power output and to obtain the optimal operation planning of energy storage system.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.323-333
• /
• 2001

This paper presents a decision making model for the cruise ship management. A network based optimization model has been developed for a single cruise ship operation. It gives optimal itinerary patterns over the planning period for the cruise ship managers wanting to maximize profit from the cruise ship operation. A network solution method to find the optimal solution is also developed. This network model can be equivalently transformed into a linear programming model, which makes the implementation of the model quite practical however complicated the given set of possible itineraries may be. The ship scheduling network developed in this study can also be used as a general framework to describe all possible cruise ship itineraries the cruise ship manager can figure out.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.247-250
• /
• 2006

Integrating a GPS based vehicle navigation system and the latest optimal algorithms, this research aims to develop a real-time decision support platform for concrete plant to provide the optimal solutions for ready mixed concrete delivery. The platform includes fleet tracking system, simulation and optimization tools, and visual interface which is useful to monitor delivery progress, to obtain crucial historical and real-time data for simulation, and to improve the efficiency of the plant operation. This paper presents configuration of the system and performance evaluation based on operational data.

• Journal of the Korean Society for Precision Engineering
• /
• v.5 no.3
• /
• pp.31-42
• /
• 1988

This paper describes a computer aided process planning system called "Deep-Drawing", "Deep-Drawing" is designed for the drawing sequence of cylindrical and rectangular cups with or without taper and flange. The computer program has written in BASIC language with personal computer. Design Rules for process planning are formulated from process limitation, plasticity theory and experimental results including the know-how of many manufacturing factories. "Deep-Drawing" Capabilities include the analysis of drawing sequence by the determination of optimal drawing ratio, the determination of intermediate shape, dimensions, punch and die radius etc., the calculation of drawing loads and blank holder force to perform each drawing step, and the graphic outputs for the operation sheet.tputs for the operation sheet.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.19-27
• /
• 1997

This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.1027-1032
• /
• 2019

In this paper, we had developed an algorithm that can cope with all the economic variables that may occur in the operation of PV-ESS system by developing the algorithm for the operation method of PV-ESS connected system. Based on this, the optimal operation schedule of PV-ESS was decided to minimize the electric charges of customers. Through this, we developed a three-dimensional dynamic planning method based on case generation to determine the optimal PV-ESS operation schedule stably even when exogenous variables change.

• Proceedings of the KIEE Conference
• /
• 1983.07a
• /
• pp.167-169
• /
• 1983

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.617-620
• /
• 1987

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.412-413
• /
• 2006

This paper proposed the transmission planning mechanism in competitive power markets. This mechanism used Optimal Power Flow(OPF) to calculate operation cost and Contingency Constrained OPF(CC-OPF) to consider N-1 contingency outage. In addition, this algorithm deduced a yearly transmission planning using Dynamic Programming(DP).