• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.81-84
• /
• 2003

The ability to determine the optimal frequencies and offsets for independent and unrestricted ordering cycles for multiple items can be very valuable for managing storage capacity constrained facilities in a supply chain. The complexity of this problem has resulted in researchers focusing on more tractable surrogate problems that are special cases of the base problem. Murthy et al. (European Journal of Operation Research 2003) developed insights leading to solution of the original problem and present a heuristic for offsetting independent and unrestricted ordering cycles for items to minimize their joint storage requirements. However, their study cannot find optimal solution due to the Greedy Heuristic solution procedure. In this paper, we present a complete procedure to find the optimal solution for the model with a integer programming optimization approach and genetic algorithm. Numerical examples are included to compare each model with that of Murthy et at. Research of this type may prove useful in solving the more general problem of selecting order policies to minimize combined holding, ordering, and storage costs.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.160.1-160.1
• /
• 2012

We present an alternative approach for satellite formation reconfiguration by an optimal impulsive-thrust strategy to minimize the total characteristic velocity in a near-circular-orbit. Linear transformation decouples the Hill-Clohessy-Wiltshire(HCW) dynamics into a new block-diagonal system matrix consisting of 1-dimensional harmonic oscillator and 2-dimensional subsystem. In contrast to a solution based on the conventional primer vector theory, the optimal solution and the necessary conditions are represented as times and directions of impulses. New analytical expression of the total characteristic velocity is found for each sub systems under general boundary conditions including transfer time constraint. To minimize the total characteristic velocity, necessary conditions for times and directions of impulses are analytically solved. While the solution to the 1-dimensional harmonic oscillator has been found, the solution to the 2-dimensional subsystem is currently under construction. Our approach is expected to be applicable to more challenging problems.

• Journal of Bio-Environment Control
• /
• v.14 no.3
• /
• pp.174-181
• /
• 2005

Experiments were carried out to develop an optimal nutrient solution for the single-stemmed rose (Rosa hybrida L.) 'Red velvet' in a closed aeroponic system. Plants were grown in 1/3, 1/2, 1, or 3/2 strength of the nutrient solution of National Horticultural Research Station in Japan (NHRS). Significantly less changes of pH and EC ($dS{\cdot}m^{-1}$) in the drainage were observed in 1/2 strength treatment as compared to other treatments. The $NO_3-N$, K, Ca, and Mg concentrations in the drainage solution of 1/2 strength treatment were maintained at optimal levels. These results indicated that the rose uptakes of both nutrients and water was more stable than those in other concentration. The concentration of macronutrients in nutrient solution were adjusted based on the ratio of nutrient:water (n/w) taken up by plants grown in the 1/2 strength solution. The composition of the new solution (classified the University of Seoul (UOS) solution) was as follow; $NO_3-N$ 8.8, $NH_4-N$ 0.67, P 2.0, K 4.8, Ca 4.0, Mg 2.0 $me{\cdot}L^{-1}$. To further evaluate new solution on crop growth, the rose 'Red Velvet' was grown again in l/2, 1, and 2 strength UOS solution to compare with 1.0 strength PBG (proefstion voor bloemisterij en glasgroenpe) solution. Overall the plant growth, including the stem length and number of five-leaflet leaves was higher in 1.0 strength of UOS solution than other treatments. Results presented in this study indicate that the nutrients in the UOS solution are well balanced for the single-stemmed rose in the closed aeroponic system.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.5
• /
• pp.57-68
• /
• 1995

A general procedure for the numerical solution of coupled, nonlinear, differential two-point boundary-value problems, solutions of which are crucial to the controller design, has been developed and demonstrated. A fixed-end-points, free-terminal-time, optimal-control problem, which is derived from Pontryagin's Maximum Principle, is solved by an extension of Davidenko's method, a differential form of Newton's method, for algebraic root finding. By a discretization process like finite differences, the differential equations are converted to a nonlinear algebraic system. Davidenko's method reconverts this into a pseudo-time-dependent set of implicitly coupled ODEs suitable for solution by modern, high-performance solvers. Another important advantage of Davidenko's method related to the time-optimal problem is that the terminal time can be computed by treating this unkown as an additional variable and sup- plying the Hamiltonian at the terminal time as an additional equation. Davidenko's method uas used to produce optimal trajectories of a single-degree-of-freedom problem. This numerical method provides switching times for open-loop control, minimized terminal time and optimal input torque sequences. This numerical technique could easily be adapted to the multi-point boundary-value problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.9 no.2
• /
• pp.28-33
• /
• 1984

In this paper some procedures are given whereby an analytic solution may be found for the Riccati differential equation and algebraic Riccati equation in optimal control theory. Some iterative techniques for solving these equations are presented. Rate of convergence and initialization of the iterative processes are discussed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.377-383
• /
• 2002

The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.3
• /
• pp.77-86
• /
• 1994

A New environment SENSATION for circuit optimization and statistical analysis has been developed. It provides real time simulation and includes automatic algorithms to assist for reaching optimal solution. Furthermore, statistical analysis environment is presented which aids in Monte Carlo analysis. worst case corner analysis, and sensitivity analysis. These capabilities faciliate the characterization of the effects of several operating conditions and manufacture process paramenters on the design performances. We verify that the proposed methods can obtain the optimal solution of the objective function through several experimental results.

• Journal of Korean Society of Transportation
• /
• v.12 no.1
• /
• pp.75-84
• /
• 1994

In this paper we address the issue of how an optimal sample size computation relates the level of precision required for travel demand estimations and transportation planning. We approach the problem by 1) deriving a theoretical solution, 2) developing a computational procedure (algorithm) to implement the theoretical solution, and 3) demonstrating a practical application. Ultimately, we construct a formal scheme of optimal sample size computation for use in travel data collection processe.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.554-558
• /
• 2001

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.87-98
• /
• 2006

In this paper, a class of constrained inverse eigenvalue problem for antisymmetric matrices and their optimal approximation problem are considered. Some sufficient and necessary conditions of the solvability for the inverse eigenvalue problem are given. A general representation of the solution is presented for a solvable case. Furthermore, an expression of the solution for the optimal approximation problem is given.