• IE interfaces
• /
• v.17 no.spc
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.139-147
• /
• 2012

This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity O($n^3$) of Hungarian algorithm to O(n). Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.

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

An efficient solution algorithm of the optimal load distribution problem with joint torque constraints is presented. Multiple robot system where each robot is rigidly grasping a common object is considered. The optimality criteria used is the sum of weighted norm of the joint torque vectors. The maximum and minimum bounds of each joint torque in arbitrary form are considered as constraints, and the solution that reduces the internal force to zero is obtained. The optimal load distribution problem is formulated as a quadratic optimization problem in R, where I is the number of robots. The general solution can be obtained using any efficient numerial method for quadratic programming, and for dual robot case, the optimal solution is given in a simple analytical form.

• Journal of the military operations research society of Korea
• /
• v.27 no.1
• /
• pp.28-38
• /
• 2001

A transportation problem amy have multiple optimal solutions, if an optimal solution to the problem is degenerate. This study derives a condition, under which multiple degenerate optimal solutions exist, fro ma current degenerate optimal transportation tableau by utilizing the homogeneous equation obtained from the closed loops connecting degenerate basic variable and non-basic variables, and discusses a method of generating alternative degenerate optimal solutions and their associated transportation tableaus. Each degenerate optimal solution may not have the same range of feasibility in sensitivity analysis on supply and demand quantity due to different set of shadow prices which multiple degenerate solution have.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.565-568
• /
• 1996

In this paper, a solution method is proposed to calculate the optimum solution to discrete optimal H$_{.inf}$ control problem for feedback of linear time-invariant system states and disturbance variable. From the results of this study, condition of existence and uniqueness of its solution is that transfer matrix of controlled variable to input variable is left invertible and has no invariant zeros on the unit circle of the z-domain as well as extra geometric conditions given in this paper. Through a numerical example, the noniterative solution method proposed in this paper is illustrated.

• Journal of Biosystems Engineering
• /
• v.15 no.4
• /
• pp.328-338
• /
• 1990

The objective of this study was to develop automatic systems of nutrient solution management for optimal nutrient solution environment and labor saving in water culture which enables factory crop production. In this study, an automatic control system and its driving program are developed to prepare, supply, and recover nutrient solution and to keep the optimal solution concentration level using microcomputers. Based on this study, the following conclusions are obtained: 1. The concentration measured by the system using oscillating circuit designed and built in this study, gave good agreements with the actual nutrient solution. 2. In water culture, the period of 12 hours for measuring concentration, pH, and temperature of the nutrient solution was optimum. Addition of control solution due to the decrease of the nutrient solution concentration is required in every 3 to 5 days. 3. It is estimated that the period of the whole solution change is 15 days, however, further research is needed to assure it. In addition, this period must be shortened in the future. 4. Both the hardware and software of the developed optimal nutrient solution control system in the water culture are working very well, however, it is necessary to develop a more economical one-chip micro controller to substitute for the microcomputer.

• IE interfaces
• /
• v.23 no.3
• /
• pp.257-263
• /
• 2010

Taguchi defined a good quality as 'A correspondence of product characteristic's expected value to the objective value satisfying the minimum variance condition.' For his good quality, he suggested Taguchi Method which is called Robust design which is irrelevant to the effect of these noise factors. Taguchi Method which has many success examples and which is used by many manufacturing industry. But Optimal solution of Taguchi Method is one among the experiments which is not optimal area of experiment point. On the other hand, Response Surface Method (RSM) which has advantage to find optimal solution area experiments points by approximate polynomial regression. But Optimal of RSM is depended on initial point and RSM can not use many factors because of a great many experiment. In this paper, we combine the Taguchi Method and the Response Surface Method with each advantage which is called Taguchi-RSM. Taguchi-RSM has two step, first step to find first solution by Taguchi Method, second step to find optimal solution by RSM with initial point as first step solution. We give example using catapults.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.61-76
• /
• 1995

The "optimal" solution for a decision making problem should be the one that best reflects the decision-maker's preference. For MADM (Multi-Attribute Decision-Making) problems, however, finding an optimal solution is difficult, especially when the number of alternatives, or that of attributes is relatively large. Most of the existing mathematical approaches arrive at a final solution on the basis of many unrealistic assumptions, without reflecting the decision-maker's preference structure exactly. To remedy this, some interactive methods have been proposed, but most of them require a large amount of information growing exponentially as the number of alternatives, or that of attributes increases. Therefore it is difficult for the decision-maker to maintain consistency throughout the decision making process. In this paper, an interactive method which finds optimal solutions for deterministic MADM problems with many attributes and alternatives is proposed. Instead of considering all the attributes simultaneously, this method partitions all the attributes into several mutually independent subgroups and considers one of them at each of preordered steps, where the alternatives are eliminated until the optimal one is obtained. The efficiency of the method lies in the fact that the amount of neccessary information is reduced significantly, and even further if a suboptimal solution is acceptable to the decision-maker.ion-maker.

• Journal of the Korean Mathematical Society
• /
• v.41 no.4
• /
• pp.681-715
• /
• 2004

Mathematical formulation and numerical solutions of an optimal Dirichlet boundary control problem for the Boussinesq equations are considered. The solution of the optimal control problem is obtained by adjusting of the temperature on the boundary. We analyze finite element approximations. A gradient method for the solution of the discrete optimal control problem is presented and analyzed. Finally, the results of some computational experiments are presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.572-577
• /
• 1992

In this paper, the optimal homing guidance problem is investigated for the general missile/target models described in the state-space. The closed-form solution of the optimal guidance law derived, and its asymptotic properties are studied as the time-to-go goes to infinity or zero. Futhermore, several approximate solutions of the optimal guidance law are suggested for real-time applications.