• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.121-123
• /
• 2002

In this paper, we preposed a chaos optimization method to reduce computational effort and enhance optimality of the solution in feeder reconfiguration problem. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and more easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 15 buses and 32 buses distribution systems, and the test results indicate that it is able to determine appropriate switching options for global optimum configuration with less computation.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1506-1509
• /
• 1999

This paper presents a new economic dispatch algorithm to improve the unit commitment solution while guaranteeing the near optimal solution without reducing calculation speed. The conventional economic dispatch algorithms have the problem that it is not applicable to the unit commitment formulation due to the frequent on/off state changes of units during the unit commitment calculation. Therefore, piecewise linear iterative method have generally been used for economic dispatch algorithm for unit commitment. In that method, the approximation of the generator cost function makes it hard to obtain the optimal economic dispatch solution. In this case, the solution can be improved by introducing a inverse of the incremental cost function. The proposed method is tested with sample system. The results are compared with the conventional piecewise linear iterative method. It is shown that the proposed algorithm yields more accurate and economical solution without calculation speed reduction.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.94-104
• /
• 1984

Based on a new concept of connection index of a weighted graph, a new efficient houris tic algorithm of 0(v.e) for network partitioning is presented, where v and e are the number of nodes and edges, respectively. Experimental results show that our algorithm is very efficient and yields an optimal or near optimal solution for a number of partitioning problems tested. Some applications of the proposed algorithm are suggested and its computer implementation is described in detail.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.5
• /
• pp.769-779
• /
• 1997

This paper presents an approach to multiple objective scheduling of flexible manufacturing systems(FMS). The approach is an extension of the scheduling method that formulates scheduling problems using Petrinets, and applies heuristic search to find optimal or near-optimal schedules with a single objective. New evaluation functions are developed to optimize simultaneously the makespan and the total operating cost. A scheduling example is used to demonstrate the effectiveness of the proposed approach.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.443-451
• /
• 2001

This paper addresses an on-line scheduling method for track systems in semiconductor fabrication. A track system is a clustered equipment performing photolithography process in semiconductor fabrication. Trends toward high automation and flexibility in the track systems accelerate the necessity of the intelligent controller that can guarantee reliability and optimize productivity of the track systems. This paper proposes an-efficient on-line scheduling method that can avoid deadlock inherent to track systems and optimize the productivity. We employ two procedures for the on-line scheduling. First, we define potential deadlock set to apply deadlock avoidance policy efficiently. After introducing the potential deadlock set, we propose a deadlock avoidance policy using an on-line Gantt chart, which can generate optimal near-optimal schedule without deadlock. The proposed on-line scheduling method is shown to be efficient in handling deadlock inherent to the track systems through simulation.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.2
• /
• pp.166-171
• /
• 2015

In this study, an automation tool was developed for rapid evaluation of machine tool spindle designs with automated three-dimensional finite element analysis (3D FEA) using solid elements. The tool performs FEA with the minimum data of point coordinates to define the section of the spindle shaft and bearing positions. Using object-oriented programming techniques, the tool was implemented in the programming environment of a CAD system to make use of its objects. Its modules were constructed with the objects to generate the geometric model and then to convert it into the FE model of 3D solid elements at the workbenches of the CAD system using the point data. Graphic user interfaces were developed to allow users to interact with the tool. This tool is helpful for identification of a near optimal design of the spindle based on, for example, stiffness with multiple design changes and then FEAs.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.66-72
• /
• 1999

In this paper, we suggest a new lifetime allocation method of genetic algorithm with varying population size. This method can control the size of the population according to the fitness values. The population size is stabilized near the neighbourhood of the optimal value. We used the diploidy method in the coding of the chromosomes. Several simulations confirm that the new allocation method can control the size of the population.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.9
• /
• pp.65-72
• /
• 2011

A binary integration is one of sub-optimal pulse integration which decides detection based on discriminating m successful detections out of n trials in radar systems using multiple pulse repetition frequencies. This paper introduces target measurement error reduction technique to reduce azimuth errors in suboptimal binary integration radar which applies the near value by m rather than the optimal m and verifies the performance by analyzing the experimental data measured from real radar.

• YAKHAK HOEJI
• /
• v.6 no.2
• /
• pp.18-22
• /
• 1962

Purified preparation of .betha.-amylase is obtained from radish root by the means of fractional precipitation with ammonium sulfate. Purified preparation saccharifies the starch, .betha.-maltose being formed. Dextrinization in the true sense does not take place. Hydrolysis ceases when approximately 50% of the theoretical yield of maltose is obtained and there remains a substance (to be .betha.-limit dextrin) which gives a blue-violet with iodine, no glucose being formed. Stability of preparation is optimal at pH 4-9 and more completely inactivated at 65.deg. in fifteen minutes. .betha.-Amylase of radish exhibits optimal activity at and near pH 5.0, which varied depending upon the buffer. Calcium and chloride ions do not effect the activities of enzyme. The results of experiments with oxidizing, alkylating and mercaptide-forming reagents which have been reported to be specific for sulfhydryl groups confirm that free sulfhydryl groups are essential to the activity of .betha.-amylase from radish.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.30-39
• /
• 2010

This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is composed of a single depot and a series of starting and ending points of contours to be cut. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem. To solve the problem, a hybrid genetic algorithm with the local search of torch paths is proposed. The genetic algorithm is tested for hypothetical problems whose optimal solutions are known in advance due to the special structure of them. The computational results show that the algorithm generates very near optimal solutions for most cases of the test problems, which verifies the validity of the algorithms.