• 대한전기학회논문지:전력기술부문A
• /
• 제48권3호
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• 대한기계학회논문집A
• /
• 제29권10호
• /
• pp.1369-1376
• /
• 2005

In structural design, the design variables are frequently selected from certain discrete values. Various optimization algorithms have been developed fDr discrete design. It is well known that many function evaluations are needed in such optimization. Recently, sequential algorithm with orthogonal arrays (SOA), which is a search algorithm for a local minimum in a discrete space, has been developed. It considerably reduces the number of function evaluations. However, it only finds a local minimum and the final solution depends on the initial values of the design variables. A new algorithm is proposed to adopt a genetic algorithm (GA) in SOA. The GA can find a solution in a global sense. The solution from the GA is used as the initial design of SOA. A sequential usage of the GA and SOA is carried out in an iterative manner until the convergence criteria are satisfied. The performance of the algorithm is evaluated by various examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.812-815
• /
• 1996

In this paper, we consider the optimal control problem based on Discrete Event Dynamic Systems(DEDS) in the Temporal Logic framework(TLF) which have studied for a convenient modeling technique. The TLF is enhanced with objective functions(event cost indices) and a measurement space is also defined. Our research goal is the design of the optimal controller for DEDSs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

• 한국지능시스템학회논문지
• /
• 제7권2호
• /
• pp.25-33
• /
• 1997

A DEDS is a system whose states change in response to the occurence of events from a predefined event set. In this paper, we consider the optimal control and reasoning problem for Discrete Event Systems(DES) in the Temporal Logic Framework(TEL) which have been recnetly defined. The TLE is enhanced with objective functions(event cost indices) and a measurement space is alos deined. A sequence of event which drive the system form a give initial state to a given final state is generated by minimizing a cost functioin index. Our research goal is the reasoning of optimal trajectory and the design of the optimal controller for DESs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following ; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

• Computers and Concrete
• /
• 제13권4호
• /
• pp.457-482
• /
• 2014

This paper summarizes available literature on the optimization of reinforced concrete (RC) beams. The objective of optimization (e.g. minimum cost or weight), the design variables and the constraints considered by different studies vary widely and therefore, different optimization methods have been employed to provide the optimal design of RC beams, whether as isolated structural components or as part of a structural frame. The review of literature suggests that nonlinear deterministic approaches can be efficiently employed to provide optimal design of RC beams, given the small number of variables. This paper also presents spreadsheet implementation of cost optimization of RC beams in the familiar MS Excel environment to illustrate the efficiency of the exhaustive enumeration method for such small discrete search spaces and to promote its use by engineers and researchers. Furthermore, a sensitivity analysis is performed on the contribution of various design parameters to the variability of the overall cost of RC beams.

• 제어로봇시스템학회논문지
• /
• 제17권2호
• /
• pp.145-148
• /
• 2011

In this paper, we proposed a search method for structured light pixels of omnidirectional structured light image. Since the omnidirectional structured light image is composed of several circular arc segments, the proposed algorithm searches the structured light pixels in radial direction rather than horizontal or vertical directions. The proposed search algorithm is based on the well-known Bresenham raster algorithm for line drawing in discrete integer space, thereby computation of the algorithm is very efficient. Comparison results between the proposed search algorithm and the conventional horizontal search are presented in experiments.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• 대한기계학회논문집A
• /
• 제24권5호
• /
• pp.1193-1202
• /
• 2000

The paper describes the use of genetic algorithms (GA's) to the minimum weight design of stiffened composite panels for buckling constraints. The proposed design problem is characterized by mixture of continuous and discrete design variables corresponding to panel elements and stacking sequence of laminates, respectively. Design space is multimodal and non-convex, thereby introducing the need for global search strategies. Advanced strategies in GA's such as directed crossover, multistage search and separated crossover are adopted to improve search ability and to save computational resource requirements. The paper explores the effectiveness of genetic algorithms and their advanced strategies in designing stiffened composite panels under various uniaxial compressive load conditions and the linrlit on stacking sequence of laminates.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권1호
• /
• pp.43-56
• /
• 2010

The representative numerical algorithms to solve the time dependent Navier-Stokes equations are projection type methods. Lots of projection schemes have been developed to find more accurate solutions. But most of projection methods [4, 11] suffer from inconsistency and requesting unknown datum. E and Liu in [5] constructed the gauge method which splits the velocity $u=a+{\nabla}{\phi}$ to make consistent and to replace requesting of the unknown values to known datum of non-physical variables a and ${\phi}$. The errors are evaluated in [9]. But gauge method is not still obvious to find out suitable combination of discrete finite element spaces and to compute boundary derivative of the gauge variable ${\phi}$. In this paper, we define 4 gauge algorithms via combining both 2 decomposition operators and 2 boundary conditions. And we derive variational derivative on boundary and analyze numerical results of 4 gauge algorithms in various discrete spaces combinations to search right discrete space relation.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1995년도 가을 학술발표회 논문집
• /
• pp.17-24
• /
• 1995

This work proposes an optimality criteria applicable to the optimum design of plane frames. Stress constraints as well as displacement constraints are treated as behavioural constraints and thus the first order approximation of stress constraints is adopted. The design space of practical reinforced concrete frames with discrete design variables has been found to have many local minima, and thus it is desirable to find in advance the mathematical minimum, hopefully global, prior to starting to search a practical optimum design. By using the mathematical minimum as a trial design of any search algorithm, we may not full into a local minimum but apparently costly design. Therefore this work aims at establishing a mathematically rigorous method ⑴ by adopting first-order approximation of constraints, ⑵ by reducing the design space whenever minimum size restrictions become "active" and ⑶ by the of Newton-Raphson Method.