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

Proper resource allocation is also a very important topic in power system problems, especially in operation and planning. One such is optimal maintenance problem in operation and planning. Least cost and highest reliability should be the subjects to be pursued. A probabilistic operation simulation model developed recently by authors is applied to the proboem of optimal maintenance scheduling. Three different methods are compared, marginal maintenance cost, levelized risk and maintenance space. The method by the marginal maintenance costs shows the least cost, the highest reliability and the highest maintenance outage rates. This latter characteristics may considerably influence the results of genetation planning, because the usual maintenance outages obtained from the other methods have shown to be lower.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.1
• /
• pp.41-47
• /
• 2011

The Pfair scheduling algorithm, which is an optimal scheduling algorithm in the hard real-time multiprocessor environments, propose the necessary and sufficient condition for the schedulability and is based on the fixed quantum size. Recently, several methods that determine the optimal quantum size dynamically were proposed in the mode change environments. But these methods considered only the case in which the period of a task is increased or decreased. In this paper, we also consider the case in which the execution time of a task is increased or decreased, and propose new methods that determine the optimal quantum size dynamically.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.619-627
• /
• 2002

It is unpractical for the optimal design theory based on the given model and assumption to be applied to the real-world experimentation. Particularly, when the experimenter feels it necessary to consider multiple objectives in experimentation, its modified version of optimality criteria is indeed desired. The constrained optimal design is one of many methods developed in this context. But when the number of constraints exceeds two, there always exists a problem in specifying the lower limit for the efficiencies of the constraints because the “infeasible solution” issue arises very quickly. In this paper, we developed a sequential approach to tackle this problem assuming that all the constraints can be ranked in terms of importance. This approach has been applied to the polynomial regression model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.1
• /
• pp.21-25
• /
• 1996

In this paper we suggest a general purpose RNN training algorithm which is derived on the optimal control concepts and variational methods. First, learning is regared as an optimal control problem, then using the variational methods we obtain optimal weights which are given by a two-point boundary-value problem. Finally, the modified gradient descent algorithm is applied to RNN for on-line training. This algorithm is intended to be used on learning complex dynamic mappings between time varing I/O data. It is useful for nonlinear control, identification, and signal processing application of RNN because its storage requirement is not high and on-line learning is possible. Simulation results for a nonlinear plant identification are illustrated.

• Journal of Korea Multimedia Society
• /
• v.18 no.11
• /
• pp.1375-1382
• /
• 2015

This paper aims to introduce the numerical methods for solving the optimal control theory to model bufferbloat problem. Mathematical tools are useful to provide insight for system engineers and users to understand better about what we are facing right now while experiment in a large-scale testbed can encourage us to implement in realistic scenario. In this paper, we introduce a survey of the numerical methods for solving the optimal control problem. We propose the dynamic optimization sweeping algorithm for optimal control of the active queue management. Simulation results in network simulator ns2 demonstrate that our proposed algorithm can obtain the stability faster than the others while still maintain a short queue length (≈10 packets) and low delay experience for arriving packets (0.4 seconds).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

• Journal of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.549-569
• /
• 2012

In this paper asymptotic error expansions for mixed finite element approximations to a class of second order elliptic optimal control problems are derived under rectangular meshes, and the Richardson extrapolation of two different schemes and interpolation defect correction can be applied to increase the accuracy of the approximations. As a by-product, we illustrate that all the approximations of higher accuracy can be used to form a class of a posteriori error estimators of the mixed finite element method for optimal control problems.

• Smart Structures and Systems
• /
• v.4 no.4
• /
• pp.465-492
• /
• 2008

Proper pretest planning is a vital component of any successful vibration test on engineering structures. The most important issue in dynamic testing of many engineering structures is arriving at the number and optimal placement of sensors. The sensors must be placed on the structure in such a way that all the important dynamic behaviour of a structural system is captured during the course of the test with sufficient accuracy so that the information can be effectively utilised for structural parameter identification or health monitoring. Several optimal sensor placement (OSP) techniques are proposed in the literature and each of these methods have been evaluated with respect to a specific problem encountered in various engineering disciplines like aerospace, civil, mechanical engineering, etc. In the present work, we propose to perform a detailed characteristic evaluation of some selective popular OSP techniques with respect to their application to practical civil engineering problems. Numerical experiments carried out in the paper on various practical civil engineering structures indicate that effective independence (EFI) method is more consistent when compared to all other sensor placement techniques.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.831-846
• /
• 2011

There are several methods, in the literature, for finding the fuzzy optimal solution of fully fuzzy transportation problems (transportation problems in which all the parameters are represented by fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings, a new method (based on fuzzy linear programming formulation) is proposed to find the fuzzy optimal solution of unbalanced fuzzy transportation problems with a new representation of trapezoidal fuzzy numbers. The advantages of the proposed method over existing method are discussed. Also, it is shown that it is better to use the proposed representation of trapezoidal fuzzy numbers instead of existing representation of trapezoidal fuzzy numbers for finding the fuzzy optimal solution of fuzzy transportation problems. To illustrate the proposed method a fuzzy transportation problem (FTP) is solved by using the proposed method and the obtained results are discussed. The proposed method is easy to understand and to apply for finding the fuzzy optimal solution of fuzzy transportation problems occurring in real life situations.

• International Journal of Quality Innovation
• /
• v.6 no.2
• /
• pp.105-115
• /
• 2005

In recent years, high-speed recording CD-R has already become the mainstream of CD-R market. Therefore, to promote the efficiency of recording CD-R is of significant importance. This study uses Taguchi's parameter design to improve the yield rate for the process of CD-R substrate. We have found 13 three-level controllable factors from the fishbone diagram, repeated 10 times the experiment with the L27(313) orthogonal array, and measured seven quality characteristics. We employ four general methods to find the optimal parameter conditions individually. Then, we perform the confirmation experiment and compare the results. Finally, we obtain the optimal parameter conditions. According to the analysis of benefits, the optimal parameter conditions can reduce the quality loss of CD-R substrate to about 21%. In the future, the results can be extended to other research of DVD-R substrate.