• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.357-370
• /
• 2000

This study has adapted a genetic algorithm for an optimal design for the first time. the models that was used a simulation are the first and second order response surfaces model, Using an genetic algorithm in D-opimal it is more efficient than previous algorithms to get an object function. Not like other algorithm without any restrictions like troublesome about the initial solution not falling into a local optimal solution it's the most suitable algorithm.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.9
• /
• pp.424-430
• /
• 2001

A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.81-94
• /
• 1986

A shortest path dynamic programming formulation is proposed and attemped to solve an uncapacitated expansion sequencing problem. It is also compared with the Extended Binary State Space approach with total capacity. Difficulties and merits associated with the formulation are discussed. The shortest path dynamic programming lacks the separability condition and an optimal solution is not guaranteed. However it has other merits and seems to be the practical solution procedure for the expansion sequencing problem in a sense that it finds near optimal solution with less state evaluations.

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

In this paper, we consider a ring loading problem, which arises in the design of SONET bidirectional rings. We deal with the case where demands are allowed to be split and routed in two different directions. Even if integral . demands are given, the optimal solution of the problem doesn't always have integral values. We present an efficient algorithm which produces an integral optimal solution.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.273-286
• /
• 2005

Parameter identification problem of a three species (predator, mutualist-prey, and mutualist) ecological system with reaction-diffusion phenomenon is investigated in this paper. The mathematical model of the parameter identification problem is constructed and continuous dependence of the solution for the direct problem on the parameters identified is obtained. Finally, the existence of optimal solution and an optimality necessary condition for the parameter identification problem are given.

• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.93-100
• /
• 1998

The researches of Linear Programming are Khachiyan Method, which uses Ellipsoid Method, and Karmarkar, Affine, Path-Following and Interior Point Method which have Polynomial-Time complexity. In this study, Karmarkar Method is more quickly solved as 50 times then Simplex Method for optimal solution. but some special problem is not solved by Karmarkar Method. As a result, the algorithm by APL Language is proved time efficiency and optimal solution in the Primal-Dual interior point algorithm. Furthermore Karmarkar Method and Primal-Dual interior point Method is compared in some examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.234-239
• /
• 1993

Most of the control problem is for the redundant manipulators use the pseudo-inverse control, thit is, the redundancy is resolved by the pseudo-inverse of the Jacobian matrix and then the controller is designed based on this resolution. However, this pseudo-inverse control has some problems when the redundant robot repeats the cyclic tasks. This is because the pseudo-inverse resolution is a local solution that generates the different configurations of the robot arm for the same hand position. Therefore it is necessary to find the global solution that maintains the optimal configuration of the robot for the repetitive tasks. In this paper, we want to propose a redundancy resolution method by the optimal theory that uses the calculus of variation. The problem formulations are : first to convert the optimal resolution problem to an optimal control problem and then to resolve the redundancy using the necessary conditions of optimal control.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.141-157
• /
• 2004

In this paper, we consider broadband satellite systems using MF-TDMA(Multi-Frequency Time Division Multiple Access) scheme. First, we analyze return link, superframe structure, and QoS( Quality of Service) parameters in broadband satellite systems, and mathematically formulate the QoS-based optimal timeslot allocation problem as a nonlinear integer programming problem for broadband satellite systems with clear-sky and rain-fade satellite terminals, and multiple data classes. Next, we modify the proposed problem to solve it within in a fast time, and suggest the QoS-based optimal timeslot allocation scheme. Extensive simulation results show that the proposed scheme finds an optimal solution or a near optimal solution within 5ms at Pentium IV PC.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.247-259
• /
• 2003

Optimal control problem for the exploitaton of oil is investigated. The optimal control problem under consideration in this paper is governed by weak coupled parabolic PDEs and involves with pointwise state and control constraints. The properties of solution of the state equations and the continuous dependence of state functions on control functions are investigated in a suitable function space; existence of optimal solution of the optimal control problem is also proved.