• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.67
• /
• pp.19-26
• /
• 2001

A design issue for a flexible manufacturing system is to find the number of each resource type which assures a given production ratio with a minimal cost. The FMS is modeled as a closed queueing network with a local buffer of limited capacity. An efficient method to determine this optical configuration is presented. The proposed method consists of three steps : 1) determine a lower configuration, 2) derive a heuristic solution, 3) find the optimal solution. The derived heuristic solutions are close to the optical solution.

• Honam Mathematical Journal
• /
• v.8 no.1
• /
• pp.21-49
• /
• 1986

A class of singular quadratic control problem is considered. The state is governed by a higher order system of ordinary linear differential equations and very general nonstandard boundary conditions. These conditions in many important cases reduce to standard boundary conditions and because of the conditions the usual controllability condition is not needed. In the special case where the coefficient matrix of the control variable in the cost functional is a time-independent singular matrix, the corresponding optimal control law as well as the optimal controller are computed. The method of investigation is based on the theory of least-squares solutions of multi-valued operator equations.

• Journal of Korean Society of Transportation
• /
• v.12 no.3
• /
• pp.5-13
• /
• 1994

In the fields of rail and road design, most vertical alignment design have been thus far heavily dependent upon trial-and-errors of experienced engineers. However, it has long been inefficient in productivity of designing process. In order to overcome this inefficiency, this paper presents the optimal vertical alignment design method using mathematical optimization techniques. For optimization, mathematical model to minimize the construction cost is formulated and the separable programming technique and the Zoutendijk method are introduced to solve it. As result, it is shown that this optimization technique can give efficient solutions to all vertical alignment design fields with properly-estimated cost function.

• Korean Journal of Hydrosciences
• /
• v.7
• /
• pp.125-137
• /
• 1996

The subject of the paper is the selection of the number and location of raingauge stations among existing ones for the computation of mean areal precipitation and for use as input of real-time flow prediction models. The weighted average method developed by National Weather Service was used to compute MAP over the Boone River basin in Iowa with a 40 year daily data set. Two different searching methods were used to find local optimal solutions. An operational rainfall-runoff model was used to determine the optimal location and number of stations for flow prediction.

• Korean Journal of Remote Sensing
• /
• v.18 no.5
• /
• pp.291-297
• /
• 2002

Optimal allocation of viewers on a terrain in such a wav that the hidden area would be minimized has many practical applications. However, it is impossible in practical sense to evaluate all the possible allocations. In this paper, we propose an optimal allocation of viewers based on genetic algorithm that enables probabilistic search of huge solution space. An experiment for one and three viewers was performed. The algorithm converges to good solutions. Especially, in one viewer case, the algorithm found the best solution.

• Industrial Engineering and Management Systems
• /
• v.12 no.2
• /
• pp.151-160
• /
• 2013

In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality non-dominated solutions.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.10 s.241
• /
• pp.1139-1147
• /
• 2005

The shape optimal design of the plate-fin type heat sink with vortex generator is performed to minimize the pressure loss subjected to the desired maximum temperature numerically. Evaluation of the performance function, in general, is required much computational cost in fluid/thermal systems. Thus, global approximate optimization techniques have been introduced into the optimization of fluid/thermal systems. In this study, Kriging method Is used to obtain the optimal solutions associated with the computational fluid dynamics (CFD). The results show that when the temperature .rise is less than 40 K, the optimal design variables are $B_1=2.44\;mm,\;B_2=2.09\;mm$, and t=7.58 mm. Kriging method can dramatically reduce computational time by 1/6 times compared to SQP method so that the efficiency of Kriging method can be validated.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.225-228
• /
• 2001

DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.239-242
• /
• 2003

In this paper, we propose how to determine the optimal camera position using inverse kinematics of virtual link model and manipulability measure. We model the variable distance and viewing direction between a target object and a camera position as a virtual link. And, by using inverse kinematics of virtual link model, we find out regions that satisfy the direction and distance constraints for the observation of target object. The solution of inverse kinematics of virtual link model simultaneously satisfies camera accessibility as well as a direction and distance constraints. And we use a manipulability measure of active camera system in order to determine an optimal camera position among the multiple solutions of inverse kinematics. By using the inverse kinematics of virtual link model and manipulability measure, the optimal camera position in order to observe a target object can be determined easily and rapidly.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.311-330
• /
• 2020

This paper investigates infinite horizon optimal control problems driven by a class of backward stochastic delay differential equations in Hilbert spaces. We first obtain a prior estimate for the solutions of state equations, by which the existence and uniqueness results are proved. Meanwhile, necessary and sufficient conditions for optimal control problems on an infinite horizon are derived by introducing time-advanced stochastic differential equations as adjoint equations. Finally, the theoretical results are applied to a linear-quadratic control problem.