• ETRI Journal
• /
• v.39 no.3
• /
• pp.353-363
• /
• 2017

Recently, sink mobility has been shown to be highly beneficial in improving network lifetime in wireless sensor networks (WSNs). Numerous studies have exploited mobile sinks (MSs) to collect sensed data in order to improve energy efficiency and reduce WSN operational costs. However, there have been few studies on the effectiveness of MS operation on WSN closed operating cycles. Therefore, it is important to investigate how data is collected and how to plan the trajectory of the MS in order to gather data in time, reduce energy consumption, and improve WSN network lifetime. In this study, we combine two methods, the cluster-head election algorithm and the MS trajectory optimization algorithm, to propose the optimal MS movement strategy. This study aims to provide a closed operating cycle for WSNs, by which the energy consumption and running time of a WSN is minimized during the cluster election and data gathering periods. Furthermore, our flexible MS movement scenarios achieve both a long network lifetime and an optimal MS schedule. The simulation results demonstrate that our proposed algorithm achieves better performance than other well-known algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.199-206
• /
• 2008

The introduction of competition in electricity markets emphasizes the importance of sufficient transmission capacities to guarantee effective power transactions. Therefore, for the economic and stable electric power system operation, transmission security constrains should be incorporated into the dispatch scheduling problem. With the intent to solve this problem, we decompose a dispatch scheduling problem into a master problem(MP) and several subproblems(SPs) using Benders decomposition. The MP solves a general optimal power flow(OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. In addition, we consider interruptible loads as active control variables since the interruptible loads can participate as generators in competitive electricity markets. Numerical examples demonstrate the efficiency of the proposed algorithm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2018.05a
• /
• pp.318-320
• /
• 2018

When a ship sails on sea, it may be influenced by the environmental disturbance such as wind, wave, sea surface temperature, etc. These affect on the ship's speed, fuel consumption, safety and operating performance. It is necessary to find the optimal weather route of a ship to avoid adverse weather conditions which can put the crews in serious danger or cause structural damage to the vessel, machinery, and equipment. This study introduced how to apply A* algorithm based on sea trial test data for determining the optimal ship routes. The path cost function was modelled as a function of minimum arrival time or minimum energy depending on the time of various environment conditions. The specially modelled path-cost function and the safety constraints were applied to the A* algorithm in order to find the optimal path of the ship. The comparison of ship performances estimated by real sea trial's path and estimated optimal route during the voyage of the ship was investigated. The result of this study can be used to create a schedule to ensure safe operation of the ship with short passage time or minimum energy. In addition, the result of this study can be integrated into an on-board decision supporting expert system and displayed in Electronic Chart Display and Information System (ECDIS) to provide all the useful information to ship master.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.9
• /
• pp.960-972
• /
• 1992

This paper deals with the development of expert system in distribution system which combined with graphic user interface. The proposed expert system can recognize and adjust to the system change, and includes the rule bases of security monitoring. Also it provides load transfer algorithm for efficient load distribution. The graphic user environment for expert system is implemented in the mouse-oriented user interface with overlapped window functions and pull-down menus. Therefore, the developed graphic integrated expert system can afford to assist system operators very conveniently through the various graphic function in proposing an optimal plan of load transfer for fault restoration and outage schedule.

• Journal of the Korea Safety Management & Science
• /
• v.7 no.1
• /
• pp.137-146
• /
• 2005

크로스도킹은 물류센터의 운영 개념으로써 입고트럭에 의해 배달된 물품이 재고로써 보관됨이 없이 즉시 고객의 수요에 따라 재분류되어 출고트럭에 적재되어 고객에게 배달되는 프로세스로 구성된다. 본 연구에서는 임시보관 장소를 보유한 크로스도킹 시스템의 총 운영시간을 최소화하기 위한 입고 트럭과 출고 트럭의 일정계획 수립을 위한 수학적 모델을 개발하였다. 본 연구에서 개발한 모델의 적용으로 물류센터 내에서의 자재 취급 빈도 및 시간이 감소하여 제품 손상을 최소화 시키는 효과가 기대된다.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.704-706
• /
• 1996

This paper presents a new algorithm of unit commitment for optimal operation in power system. The proposed method developed algorithm that determined generators considering load variations at each stages. It has established forecast unit commitment over time horizon at first and next calculated quality cost of generators and then committed generator that has minimum quality cost at unit commitment schedule over time horizon. It is used that Objet-Oriented Programming for effective realization, and simple handling of complex program. The proposed method has applied at example system and the results has shown superior economics and computational requirement than the conventional method.

• IE interfaces
• /
• v.11 no.2
• /
• pp.13-24
• /
• 1998

A distribution system is composed of multiple levels from a producer to customers, and it's objective is to supply customers with goods timely with a prescribed level of quality at a minimum cost. For the installation and operation of multi-echelon distribution system, DRP(Distribution Resource Planning) is widely used. However, because of the characteristic difference of material flow dynamic of each distribution center, it is almost impossible to get the optimal distribution scheduling. In this paper, an improved DRP method to schedule multi-echelon distribution network is proposed so that the lot-size and order point is dynamically obtained to meet the change of demand rate and timing. The experiment is done with various demand pattern, forecast errors of demand and lead times of central distribution center. The proposed method is compared with traditional statistical approach.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.53-63
• /
• 2017

The increasing of wind power penetration level presents challenges in classical optimal reactive power dispatch (ORPD) which is usually formulated as a deterministic optimization problem. This paper proposes a two-stage stochastic programming model for ORPD by considering the uncertainties of wind speed and load in a specified time interval. To avoid the excessive operation, the schedule of compensators will be determined in the first-stage while accounting for the costs of adjusting the compensators (CACs). Under uncertainty effects, on-load tap changer (OLTC) and generator in the second-stage will compensate the mismatch caused by the first-stage decision. The objective of the proposed model is to minimize the sum of CACs and the expected energy loss. The stochastic behavior is formulated by three-point estimate method (TPEM) to convert the stochastic programming into equivalent deterministic problem. A hybrid Genetic Algorithm-Interior Point Method is utilized to solve this large-scale mixed-integer nonlinear stochastic problem. Two case studies on IEEE 14-bus and IEEE 118-bus system are provided to illustrate the effectiveness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.801-803
• /
• 2005

Fundamentally, success of the competitive electricity market is dependent on efficient market design. However, since electricity incorporates various physical constraints as other commodities, the resource assignment (i.e., dispatch scheduling) is also one of requisites for the successful operation of electricity market. Therefore, efficient dispatch scheduling is an important issue to succeed in the deregulated electricity market and the efficiency of this electricity market may be considerably increased by systematic studies on dispatch scheduling algorithm and corresponding constraints, especially system security. Moreover, contrary to traditional vertically-integrated electric power industry condition, since various decision-makings in deregulated electricity market are directly connected with market participants' benefits, only rational dispatch scheduling algorithm can convince these participants. Therefore, it can provide a basis of grievance prevention. In this paper, we propose an algorithm for security constrained dispatch scheduling with respect to load curtailment. Proposed algorithm decomposes the dispatch problem into a master problem corresponding to basecase optimal power flow (OPF) and several subproblems corresponding a series of contingencies using two-stage optimization technique.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.9 no.2
• /
• pp.81-86
• /
• 2014

In this paper, a jointly optimal group replacement and spare provisioning policy is presented. Most maintenance policies assume that the spare inventory is always available, but in practice the maintenance schedule is affected by the availability of spare inventory. We present a maintenance-inventory model which jointly optimizes the group replacement interval and spare ordering quantity. Group replacement policy is used when a group of units are put in operation simultaneously. The operating fleet is replaced altogether at a predetermined number of units are failed. A sufficient level of spare inventory is carried to perform a number of group replacement. A cost rate expression which considers the group maintenance cost and inventory holding cost is derived and a heuristic method for searching the optimum value of decision variables is suggested. Numerical examples demonstrate the analytical results and the performance of the presented model.