• The Korean Journal of Emergency Medical Services
• /
• v.4 no.1
• /
• pp.17-29
• /
• 2000

As technology advances rapidly, emergency medical dispatching systems must also advance. Optimal emergency medical dispatching requires the courage to practice medicine at dispatch. Modern emergency medical dispatch provides appropriate resource responses with the use of an (Advanced Medical priority Dispatch System(AMPDS) in U.S.A. The AMPDS is a systematic protocol for all aspects of the dispatch process. Based on the AMPDS chief complaint list, we initiated a basic design on pre-arrival instruction protocol and completed the scripted pre-arrival instruction protocol, using Cardiopulmonary resuscitation(CPR) protocol. Implementation of this study creates computerized emergency medical dispatching system for future enhancements, such as the AMPDS.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.4
• /
• pp.476-483
• /
• 2008

This paper is aimed at presenting techniques of hybrid differential evolution for solving various kinds of Economic Dispatch(ED) problems such as those including prohibited zones, emission dispatch, multiple fuels, and multiple areas. The results obtained for typical problems are compared with those obtained by other techniques such as Particle Swarm Optimization(PSO) and Classical Evolutionary Programming(CEP) techniques. The comparison of the results proves that hybrid differential evolution is quite favorable for solving ED problems with no restrictions on the shapes of the input-output functions of the generator.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.1
• /
• pp.19-27
• /
• 2009

This paper presents a newly developed optimization algorithm, the Bee Optimization Algorithm (BeeOA), to solve the economic power dispatch (EPD) problem. The authors have developed a derivative free and global optimization technique based on the working of the honey bee. The economic power dispatch problem is a nonlinear constrained optimization problem. Classical optimization techniques fail to provide a global solution and evolutionary algorithms provide only a good enough solution. The proposed approach has been examined and tested on two test systems with different objectives. A simple power dispatch problem is tested first on 6 generators and then the algorithm is demonstrated on 13 thermal unit systems whose incremental fuel cost function takes into account the value point loading effect. The results are promising and show the effectiveness and robustness of the proposed approach over recently reported methods.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1508-1517
• /
• 2015

Optimal Power dispatch is the short-term decision of the optimal output of a number of power generation facilities, to meet the system demand, with the objective of Power dispatching at the lowest possible cost, subject to transmission lines power loss and operational constraints. The operational constraint includes power balance constraint, generator limit constraint, and emission dispatch constraint and valve point effects. In this paper, Opposition based Differential Evolution Algorithm (ODEA) has been proposed to handle the objective function and the operational constraints simultaneously. Furthermore, the valve point loading effects and transmission lines power loss are also considered for the efficient and effective Power dispatch. The ODEA has unique features such as self tuning of its control parameters, self acceleration and migration for searching. As a result, it requires very minimum executions compared with other searching strategies. The effectiveness of the algorithm has been validated through four standard test cases and compared with previous studies. The proposed method out performs the previous methods.

• 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.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.806-807
• /
• 2007

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. When System Operator (SO) establishes a dispatch schedule, the bid information should be preserved in the schedule as much as possible. In this paper, we introduce a new type of sensitivity factor called Line Outage Impact Factor (LOIF) to screen a transmission line causing the most severe outage when scheduling the dispatch. This screening can assure the stable system operation and make an efficient feedback between the SO and market participants. We propose a transmission line contingency constrained Pre-dispatch algorithm using sensitivity indices in a suitable Pre-dispatch scheduling. The proposed algorithm has been tested on sample system and the results show more secure operation against critical contingencies.

• Journal of the Korean Society for information Management
• /
• v.33 no.3
• /
• pp.287-319
• /
• 2016

Dispatch of ROK Armed Forces is a significant contemporary event that enhances the ROK's position in the international communities and ensures the solid national security by contributing international peace keeping operations. Indirectly, dispatch of armed forces also can contribute to strengthen the national defense. However, despite its importance, record management related to the dispatch is not done properly. Because variable records produced in the process of dispatching troops are transferred to distributed archives, searching or accessing each record is not easy and making a collection from a series of record related to certain dispatch is more difficult. Moreover, since most transferred records were produced in the public domain, production and management of record in the aspect of archive of everyday life is needed. In this paper, we summarize the current state of domestic records by dispatch procedure, organization, and dispatched troops. And we also explore the problem of record management.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.9
• /
• pp.424-430
• /
• 2001

A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• 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 KIEE Conference
• /
• 2000.07a
• /
• pp.347-349
• /
• 2000

Under an open transmission access, the generation dispatch is determined by the bidding process of market participants. Congestion occurs when the dispatch would result in the violation of operational constraints. Congestion problem is formulated and solved by OPF(optimal power flow) calculation. The objective functions in OPF are given as quadratic cost functions or piecewise linear functions of bidding functions. In this study, the optimization technique of generation dispatch is presented for the combination of two types of quadratic and linear cost functions.