• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.789-796
• /
• 2012

To find the module sequence that makes correction rate optimal is the goal of this paper. The Hill-climbing algorithm was used in the experiment to analyze the performance of Korean Spelling Corrector. Given the wrong eojul set, We found the module sequence that shows correction rate of 96.41%. Because of the quite high correction rate, Hill-climbing is a practical method for our Spelling Corrector.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1523-1531
• /
• 2011

Multi-axle driving vehicle are favored for military use in off road operations because of their high mobility on extreme terrains and obstacles. Especially, Military Vehicle needs an ability to driving on hills of 60% angle slope. This paper presents the improvement of the ability of hill climbing for 6WD/6WS vehicle through the optimal tire force distribution method. From the driver's commands, the desired longitudinal force, the desired lateral force, and the desired yaw moment were obtained for the hill climbing of vehicle using optimal tire force distribution method. These three values were distributed to each wheel as the torque based on optimal tire force distribution method using friction circle and cost function. To verify the performance of the proposed algorithm, the simulation is executed using TruckSim software. Two vehicles, the one the proposed algorithm is implemented and the another the tire's forces are equivalently distributed, are compared. At the hill slop, the ability to driving on hills is improved by using the optimum tire force distribution method.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.129-138
• /
• 2006

Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.111-113
• /
• 2006

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.6
• /
• pp.57-65
• /
• 2015

Manufacturing optimization problem is to find the optimal solution under satisfying various and complicated constraints with the design variables of nonlinear types. To achieve the objective, this paper proposes a hybrid approach. The proposed hybrid approach is consist of genetic algorithm(GA), cuckoo search(CS) and hill climbing method(HCM). First, the GA is used for global search. Secondly, the CS is adapted to overcome the weakness of GA search. Lastly, the HCM is applied to search precisely the convergence space after the GA and CS search. In experimental comparison, various types of manufacturing optimization problems are used for comparing the efficiency between the proposed hybrid approach and other conventional competing approaches using various measures of performance. The experimental result shows that the proposed hybrid approach outperforms the other conventional competing approaches.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.33-39
• /
• 2019

In this paper, we propose a parametric model for analyzing the motion information obtained from the acceleration sensors to measure the activity of the human body. The motion of the upper body and the lower body does not occur at the same time, and the motion analysis method using a single motion sensor involves a lot of errors. In this study, the 3-axis accelerometer is attached to the arms and legs, the body's activity data are measured, the momentum of the arms and legs are calculated for each channel, and the linear predictive coefficient is obtained for each channel. The periodicity of the upper body and the lower body is determined by analyzing the correlation between the channels. The linear predictive coefficient and the periodic value are used as data to measure the type of exercise and the amount of exercise. In the proposed method, we measured four types of movements such as walking, stair climbing, slow hill climbing, and fast hill descending. In order to verify the usefulness of the parameters, the recognition results are presented using the linear predictive coefficient and the periodic value for each motion as the neural network input.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.13-27
• /
• 2012

Integer programming-based local search(IPbLS) is a kind of local search based on simple hill-climbing search and adopts integer programming for neighbor generation unlike general local search. According to an existing research [1], IPbLS is known as an effective method for the multidimensional knapsack problem(MKP) which has received wide attention in operations research and artificial intelligence area. However, the existing research has a shortcoming that it verified the superiority of IPbLS targeting only largest-scale problems among MKP test problems in the OR-Library. In this paper, I verify the superiority of IPbLS more objectively by applying it to other problems. In addition, unlike the existing IPbLS that combines simple hill-climbing search and integer programming, I propose methods combining other local search algorithms like hill-climbing search, tabu search, simulated annealing with integer programming. Through the experimental results, I confirmed that IPbLS shows comparable or better performance than the best known heuristic search also for mid or small-scale MKP test problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1141-1149
• /
• 2000

This paper proposes new cost error measurement method and analyzes the optimistic and pessimistic cost errors statistically which is resulted from an asynchronous parallel Simulated annealing (SA) in distributed memory multicomputers. The traditional cost error measurement scheme has inherent problems which are corrected in the new method. At each temperature the new method predicts the amount of cost error that an algorithm will tolerate and still converge by the hill-climbing nature of SA. This method also explains three interesting phenomenon of he cost error analytically. So the new cost error measurement method provides a single mechanism for the occurrence of cost error and its control.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2002.10a
• /
• pp.65-84
• /
• 2002

The Observational Method proposed by Terzaghi can be applied for the safe and economic construction projects where the exact prediction of the behavior of the structures is difficult as in the underground excavation. The method consists of measuring lateral displacement, ground settlement and axial force of supports in the earlier stage of the construction and back analysis technique to find the best fit design parameters such as earth pressure coefficient, subgrade reaction etc, which will minimize the gap between calculated displacement and measured displacement. With the results, more reliable prediction of the later stage can be obtained. In this study, back analysis programs using the Direct Method, based on the Hill Climbing Method were made and evaluated, and to overcome the limits of the method, Genetic Algorithm(GA) was applied and tested for the actual construction cases.