• 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 Institute of Military Science and Technology
• /
• v.22 no.4
• /
• pp.467-474
• /
• 2019

Recently, optical phased array(OPA) based laser detection and ranging(LADAR) has gained great interest to replace the traditional mechanical light detection and ranging technique(LiDAR). In OPA-based LADAR, it is well known that phases of laser pulses traveling through each of channels should be the same to obtain a narrow free-space single beam without noise-like ripples in the far field. However, it is difficult to provide such ideal condition due to the fabrication errors. To tackle this problem, any algorithms should be necessary to compensate the initial random phases of each channel in OPA antenna. In this paper, we propose a hill-climbing based phase calibration algorithm and evaluate the performance of the proposed algorithm.

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

• 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 Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.819-826
• /
• 2001

Genetic algorithms are becoming more popular because of their relative simplicity and robustness. Genetic algorithms are global search techniques for nonlinear optimization. However, traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain because they are poor at hill-climbing, whereas simulated annealing has the ability of probabilistic hill-climbing. Therefore, hybridizing a genetic algorithm with other algorithms can produce better performance than using the genetic algorithm or other algorithms independently. In this paper, we propose an efficient hybrid optimization algorithm named the adaptive random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural networks. This paper describes the application of genetic algorithms and simulated annealing to a random signal-based learning in order to generate the parameters and reinforcement signal of the random signal-based learning, respectively. The validity of the proposed algorithm is confirmed by applying it to two different examples.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.451-454
• /
• 2002

The fiber optic communication technology is considered as a key solution for the future communication. However the assembly of the fiber optic components highly depends on manual or semi-automated alignment process. And the light search algorithm is recognized an important factor to reduce the manufacturing process time. Therefore this paper investigates optimal search algorithm for the automatic alignment of fiber optic components. The experiments show the effectiveness of Hill Climbing Search, Adaptive Hill Climbing Search and Steepest Search algorithms, in a view of process time.

• 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 Korea Society of Industrial Information Systems
• /
• v.27 no.1
• /
• pp.37-48
• /
• 2022

In this study, a hybrid meta-heuristic approach is proposed for solving engineering design optimization problems. Various approaches in many literatures have been proposed to solve engineering optimization problems with various types of decision variables and complex constraints. Unfortunately, however, their efficiencies for locating optimal solution do not be highly improved. Therefore, we propose a hybrid meta-heuristic approach for improving their weaknesses. the proposed GA-VNS-HC approach is combining genetic algorithm (GA) for global search with variable neighborhood search (VNS) and hill climbing (HC) for local search. In case study, various types of engineering design optimization problems are used for proving the efficiency of the proposed GA-VNS-HC approach

• Journal of Multimedia Information System
• /
• v.2 no.1
• /
• pp.179-186
• /
• 2015

This paper describes the application of a simulated annealing to a random signal-based learning. The simulated annealing is used to generate the reinforcement signal which is used in the random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural network. It is poor at hill-climbing, whereas simulated annealing has an ability of probabilistic hill-climbing. Therefore, hybridizing a random signal-based learning with the simulated annealing can produce better performance than before. The validity of the proposed algorithm is confirmed by applying it to two different examples. One is finding the minimum of the nonlinear function. And the other is the optimization of fuzzy control rules using inverted pendulum.