• 산업공학
• /
• 제18권4호
• /
• pp.370-381
• /
• 2005

This study is concerned with seeking the optimal allocation(disposition) for maximizing utility of consolidating old fashioned and new air defense weapon system like SAM-X(Patriot missile) and developing efficient solution algorithm based on simulated annealing(SA) algorithm. The SED(selection by effectiveness degree) procedure is implemented with an enhanced SA algorithm in which neighboring solutions could be generated only within the optimal feasible region by using a specially designed PERTURB function. Computational results conducted on the problem sets with a variety of size and parameters shows the significant efficiency of our SED algorithm over existing methods in terms of both the computation time and the solution quality.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 추계학술대회 논문집 학회본부
• /
• pp.64-67
• /
• 1988

This paper proposes a algorithm to obtain a time-varing system parameters for the optimal controller. The proposed algorithm is enlarged from tile optimal sorting algorithm. It applies to Bang-Bang control and compares with CGD Method. We confirm that the proposed algorithm is excellent.

• Journal of Electrical Engineering and Technology
• /
• 제10권3호
• /
• pp.795-803
• /
• 2015

Autoreclosure provides a means of improving power transmitting ability and system stability. Conventional reclosure adopts the fixed dead time interval strategy, where the reclosure is activated after a time delay to restore the system to normal as quickly as possible without regard to the system conditions. However, these simple techniques cannot provide optimal operating performance. This paper presents an adaptive autoreclosure algorithm including variable dead time, optimal reclosure, phase-by-phase reclosure and emergency extended equal-area criterion (EEEAC) algorithm in order to improve system stability. The reclosure algorithm performs the operations that are attuned to the power system conditions. The proposed adaptive reclosure algorithm is verified and tested using ATP/EMTP MODELS, and the simulation results show that the system oscillations are reduced and the transient stability is enhanced by employing the proposed adaptive reclosure algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.591-594
• /
• 1988

A three-step heuristic algorithm for PLA column folding and row folding of column-folded PLA is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are i) min-cut partition of vertices in the column (or row) intersection graph, ii) determination of products' order using Fiduccia's min-net cut algorithm, and iii) head-tail pairing for column folding, while some heuristics are proposed for deciding row folding pairs. The time complexity of this algorithm is O($n^{2}$log n) compared to the O($n^{3}$) - O($n^{4}$) of the earlier works.$^[2][3][9]$ For a test PLA with 23 inputs, 19 outputs and 52 products, the number of column folding pairs obtained using this algorithm is 20 which is optimal, as compared to 17 in a previous work.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권12호
• /
• pp.698-704
• /
• 2003

Autoreclosure provides a mean of improving power transmitting ability and system stability. The conventional reclosure adopts the fixed dead time interval strategy, that is, the reclosure is activated after a time delay to restore the system to normal as quickly as possible without regard to the system conditions, however, these simple techniques cannot give the optimal operating performance. For this reason, various adaptive reclosure algorithms have been proposed recently, This paper presents an adaptive autoreclosure algorithm including the variable dead time, optimal reclosure, sequential reclosure and emergency extended equal-area criterion (EEAC) algorithm in order to improve the system stability. The reclosure algorithm performs out the operations that are attuned to the power system conditions. The proposed adaptive reclosure algorithm is verified and tested by using EMTP MODELS, and the simulation results show that the system oscillations are reduced and the transient stability is enhanced by employing the proposed adaptive reclosure algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제21권6호
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• 전기학회논문지
• /
• 제58권9호
• /
• pp.1706-1713
• /
• 2009

In this paper, a parallel operation algorithm for high power PEMFC generation systems is proposed. According to increasing the capacity of fuel cell systems with several fuel cell stacks, the different dynamic characteristics of each fuel cell stack effect on imbalance of load sharing and current distribution, so that a robust parallel operation algorithm is desired. Therefore, a power-sharing technique is developed and explained in order to design an optimal distributed PEMFC generation system. In addition, an optimal controller design procedure for the proposed parallel operation algorithm is introduced, along with informative simulations and experimental results.

• 대한산업공학회지
• /
• 제15권1호
• /
• pp.105-116
• /
• 1989

This study presents an algorithm that determines the optimal configuration of the FMSs with limited local buffers. The algorithm finds the lowest cost configuration, i.e. the number of tools, the number of pallets as well as the number of buffers to be installed in front of each machine in the system. Thus it assures a given production ratio with a minimum cost. In the algorithm, FMSs are considered as the closed queueing network with limited queue length. System performance evaluation is performed using the Block-&-Recirculation model developed by Yao and Buzacott. The algorithm is composed with three steps. The steps are namely i) determination of a lower configuration, ii) derivation of an heuristic solution, and iii) obtaining the optimal solution. The computational efforts required in the algorithm usually lies within the capability of personal computers.

• 조명전기설비학회논문지
• /
• 제29권5호
• /
• pp.34-40
• /
• 2015

This paper presents an application of Differential Search (DS) meta-heuristic optimization algorithm for optimal operation of micro grid system. DS algorithm has the benefit of high convergence rate and precision compared to other optimization methods. The micro grid system consists of a wind turbine, a diesel generator, and a fuel cell. The simulation is applied to micro grid system only. The wind turbine generator is modeled by considering the characteristics of variable output. One day load data which is divided every 20 minute and wind resource for wind turbine generator are used for the study. The method using the proposed DS algorithm is easy to implement, and the results of the convergence performance are better than other optimization algorithms.