• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.1008-1015
• /
• 2002

This paper proposes a combinatorial method to compute the global and local solutions of optimization problem. The present hybrid algorithm is the synthesis of a genetic algorithm and a local concentrate search algorithm (simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm, but also gives a more accurate solution. In addition, this algorithm can find both the global and local optimum solutions. An optimization result is presented to demonstrate that the proposed approach successfully focuses on the advantages of global and local searches. Three numerical examples are also presented in this paper to compare with conventional methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.1
• /
• pp.21-28
• /
• 2005

This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.84-101
• /
• 1997

Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.698-702
• /
• 2001

This paper presents a combinatorial method to compute the solutions of optimization problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The hybrid algorithm is not only faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. And the enhanced artificial life algorithm is applied to optimum design of high-speed, short journal bearings and the usefuless is verified through this example.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.5
• /
• pp.748-754
• /
• 2008

The general capacitor placement problem is a combinatorial optimization problem having an objective function composed of power losses and capacitor installation costs subject to bus voltage constraints. In this paper, a global optimization technique, which employing the chaos search algorithm, is applied to solve optimal capacitor placement problem with reducing computational effort and enhancing global optimality of the solution. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 9 buses and 69 buses system to illustrate the effectiveness of the proposed method.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.381-386
• /
• 2000

Simple spring-damper-mass models have been widely used to understand whole-body vertical biodynamic response characteristics of the seated vehicle driver. However, most previous models have not considered about the non-rigid masses(wobbling masses). A simple mechanical model of seated human body developed in this study included the torso represented by a rigid and a wobbling mass. Within the 0.5-20Hz frequency range and for excitation amplitudes maintained below $5ms^{-2}$, this 4-degree-of-freedom driver model is proposed to satisfy the measured vertical vibration response characteristics defined from a synthesis of published data for subjects seated erect without backrest support. The parameters are identified by using the combinatorial optimization technique, simulated annealing method. The model response was found to be provided a closer agreement with the response characteristics than previously published models.

• Macromolecular Research
• /
• v.16 no.4
• /
• pp.320-328
• /
• 2008

We established a thermodynamic framework of group contribution method based on modified double lattice (MDL) model. The proposed model included the long-range interaction contribution caused by the Coulomb electrostatic forces, the middle-range interaction contribution from the indirect effects of the charge interactions and the short-range interaction from modified double lattice model. The group contribution method explained the combinatorial energy contribution responsible for the revised Flory-Huggins entropy of mixing, the van der Waals energy contribution from dispersion, the polar force, and the specific energy contribution from hydrogen bonding. We showed the solvent activities of various polymer solution systems in comparison with theoretical predictions based on experimental data. The proposed model gave a very good agreement with the experimental data.

• School Mathematics
• /
• v.11 no.1
• /
• pp.17-37
• /
• 2009

Concept and model of multiplication is not single. Concepts of multiplication can be classified into three cases: repeated addition, times idea, pairs set. Models of multiplication can be classified into four cases: measurement, rectangular pattern, combinatorial problem, number line. Among diverse cases of multiplication's concept and model, which case does elementary mathematics education lay stress on? This question is a controvertible didactical point. In this thesis, (1) mathematical and didactical analysis of multiplication's concept and model is performed, (2) a concrete program of teaching multiplication which is based on times idea is contrived, (3) With this new program, the teaching experiment is performed and its result is analyzed. Through this study, I obtained the following results and suggestions. First, the degree of testee's understanding of times idea is not high. Secondly, a sort of test problem which asks the testee to find times value is more easy than the one to find multiplicative resulting value. Thirdly, combinatorial problem can be handled as an application of multiplication. Fourthly, the degree of testee's understanding of repeated addition is high. In conclusion, I observe the fact that this new program which is based on times idea could be a alternative program of teaching multiplication which could complement the traditional method.

• IE interfaces
• /
• v.15 no.2
• /
• pp.189-198
• /
• 2002

Simulated Annealing(SA) approach has been successfully applied to the combinatorial optimization problems with NP-hard complexity. To apply an SA algorithm to specific problems, generic parameters as well as problem-specific parameters must be determined. To overcome the embedded nature of SA, long computational time, some studies suggested the parameter design methods of determining SA related parameters. In this study, we propose a new parameter design approach based on robust design method. To show the effectiveness of the proposed method, the extensive computation experiments are conducted on the mixed-model sequencing problems.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.154-157
• /
• 2003

In order for testing faults of combinatorial logic circuit, the authors have developed a new diagnosis method: "Neural Network (NN) fault diagnosis", based on fm error back propagation functions. This method has proved the capability to test gate faults of wider range including so called SSA (single stuck-at) faults, without assuming neither any set of test data nor diagnosis dictionaries. In this paper, it is further shown that what kind of fault models can be detected in the NN fault diagnosis, and the simply modified one can extend to test delay faults, e.g. logic hazard as long as the delays are confined to those due to gates, not to signal lines.