| 摘要 |
<p>The Purpose of the invention entitled as HILL CLIMBING PROBLEM is to find the solution of Hill Climbing problem for randomly generated objects of irregular dimensional shapes. In the present solution of the problem an object with the pre-defined shape and size can reach to the destination which is the top of the hill. The problem is with the irregular size objects which tend to be rigid and they cannot reach to the top of the hill due to the local Maxima and Minima problem. The concepts of hill climbing algorithm can be successfully applied when the object under consideration is of a definite shape & size. The difficulty arises when the object is irregular in nature and the shape & size is not predefined. Our final goal of this invention is to find the solution for an irregular size object to reach to the destination. Contradiction is that the object with the irregular shape and size will reach to the destination but after the certain consistent in synapses. In the existing solution we have Simple Hill Climbing and Steepest Ascent Hill Climbing. However, both these form fails when there are no closer nodes. This may happen when we arrive at local maxima, which is not actually the global peak. One way to get around the problem in hand which we will be using is to find a saturation point using Simulated Annealing and then get to the final solution using a Metaheuristic Approach. Accepting worse solutions is a fundamental property of Metaheuristic, because it allows for a more extensive search for the optimal solution. Once the saturated point is obtained, i.e. the maxima is reached, the solution can be optimized using Metaheuristic Approach.</p> |
