• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.261-273
• /
• 1997

This paper presents an EMQ model which determines an optimal production cycle and inspection schedules simultaneously in a deteriorating machine. It is assumed that a machine is subject to a random deterioration from an in-control state to an out-of-control state and thus producing some proportion of defective items. Optimal solutions and minimum average cost as well as some unique properties are derived. Numerical experiments are carried out to examine the behavior of the proposed model and compare the proposed model to the existing models. Several mistakes in the previous research are found and discussed.

• Structural Engineering and Mechanics
• /
• v.5 no.6
• /
• pp.691-703
• /
• 1997

This paper investigates the optimal locations of internal point supports in a symmetric crossply laminated rectangular plate for maximum fundamental frequency of vibration. The method used for solving this optimization problem involves the Rayleigh-Ritz method for the vibration analysis and the simplex method of Nelder and Mead for the iterative search of the optimum support locations. Being a continuum method, the Rayleigh-Ritz method allows easy handling of the changing point support locations during the optimization search. Rectangular plates of various boundary conditions, aspect ratios, composed of different numbers of layers, and with one, two and three internal point supports are analysed. The interesting results on the optimal locations of the point supports showed that (a) there are multiple solutions; (b) the locations are dependent on both the plate aspect ratios and the number of layers (c) the fundamental frequency may be raised significantly with appropriate positioning of the point supports.

• IE interfaces
• /
• v.19 no.4
• /
• pp.300-305
• /
• 2006

The problem of assigning customers to satellite channels is considered in this paper. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of GA with CPLEX8.1 is presented to show the advantages of this approach in terms of computation time and solution quality.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.76-82
• /
• 2004

The solutions of neighboring optimal control are typically obtained using the sweep method or transition matrices. Due to the numerical integration, however, the gain matrix can become infinite as time go to final one in the transition matrices, and the Riccati solution can become infinite when the final time free. To overcome these disadvantages, this paper proposes the pseudospectral Legendre method which is to first discreteize the linear boundary value problem using the global orthogonal polynomial, then transforms into an algebraic equations. Because this method is not necessary to take any integration of transition matrix or Riccati equation, it can be usefully used in real-time operation. Finally, its performance is verified by the numerical example for the space vehicle's orbit transfer.

• Aerospace Engineering and Technology
• /
• v.7 no.1
• /
• pp.61-67
• /
• 2008

To design flight control law of an unmanned aerial vehicle, automated control gain determination program was developed. The procedure for determination of control gain was formulated as the control gains were designed from the optimal solutions of the optimization problem. PSO algorithm, which is one of the evolutionary computation method, and SQP algorithm, which is one of the nonlinear programming method, are used as optimization problem solver. Thru this technique, computation time required for finding the optimal solution is decreased to 1/5 of that of PSO algorithm and more accurate optimal solution is obtained.

• International Journal of Reliability and Applications
• /
• v.2 no.2
• /
• pp.99-105
• /
• 2001

Delay time analysis is a pragmatic mathematical concept readily embraced by engineers which has been developed as a means to model maintenance decision problem. This paper considers an inspection period using delay time analysis for fishing vessel equipment. We assume that delay time has a Weibull distribution. In this paper, we determine the optimal inspection period which minimize the expected downtime per unit time. Explicit solutions for the optimal inspection are presented for illustrative purposes.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.16 no.12
• /
• pp.1156-1166
• /
• 2004

The shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. In constrained nonlinear optimization problems of thermal/fluid systems, three fundamental difficulties such as high computational cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are commonly confronted. Thus, a sequential approximate optimization (SAO) algorithm has been introduced because it is very hard to obtain the optimal solutions of fluid/thermal systems by means of gradient-based optimization techniques. In this study, the progressive quadratic response surface method (PQRSM) based on the trust region algorithm, which is one of sequential approximate optimization algorithms, is used for optimization and the heat sink is optimized by combining it with the computational fluid dynamics (CFD).

• Journal of Korea Water Resources Association
• /
• v.40 no.9
• /
• pp.677-685
• /
• 2007

The objective of this study is to evaluate the applicability of multi-objective genetic algorithm(MOGA) in order to calibrate the parameters of conceptual rainfall-runoff model, Tank model. NSGA-II, one of the most imitating MOGA implementations, is combined with Tank model and four multi-objective functions such as to minimize volume error, root mean square error (RMSE), high flow RMSE, and low flow RMSE are used. When NSGA-II is employed with more than three multi-objective functions, a number of Pareto-optimal solutions usually becomes too large. Therefore, selecting several preferred Pareto-optimal solutions is essential for stakeholder, and preference-ordering approach is used in this study for the sake of getting the best preferred Pareto-optimal solutions. Sensitivity analysis is performed to examine the effect of initial genetic parameters, which are generation number and Population size, to the performance of NSGA-II for searching the proper paramters for Tank model, and the result suggests that the generation number is 900 and the population size is 1000 for this study.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.73-85
• /
• 2000

The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.