# hill climbing

(redirected from Hill-climbing algorithm)

## hill climbing

(algorithm)
A graph search algorithm where the current path is extended with a successor node which is closer to the solution than the end of the current path.

In simple hill climbing, the first closer node is chosen whereas in steepest ascent hill climbing all successors are compared and the closest to the solution is chosen. Both forms fail if there is no closer node. This may happen if there are local maxima in the search space which are not solutions. Steepest ascent hill climbing is similar to best first search but the latter tries all possible extensions of the current path in order whereas steepest ascent only tries one.
References in periodicals archive ?
Generally speaking, a hill-climbing algorithm starts from some configuration (say, a completely random assignment of letters to squares of the chessboard) and continually tries to improve it via small "tweaks".
In [26], aGA is combined with the hill-climbing algorithm to repair chromosomes.
A well known hill-climbing algorithm for static scheduling was proposed by Bokhari (42).
The hill-climbing algorithm was employed on the cavity fill pattern for generation of the flow paths.
A simple but effective technique commonly known as the hill-climbing algorithm is employed in this investigation for determining the flow paths.
In this paper, we will describe how the hill-climbing algorithm is being employed for the determination of the flow paths.
If the hill-climbing algorithm is used to find the global maximum in an unknown search space, then it is unavoidable that every solution found needs to be tested and verified,
As such, the hill-climbing algorithm can easily get bogged down in this region since there are more than one direction in which the next best step can be taken.
Thus, it is apparent that the hill-climbing algorithm is not a reliable method in locating the global maximum if the search space contains the characteristics described above.
0) can be located by applying the hill-climbing algorithm from any position within the space.
As the hill-climbing algorithm moves in the direction of steepest descent towards the injection node, the trace of arriving from a boundary location to the gate represents a strong suggestion of the path taken by the flow when the melt is injected into the cavity.
As discussed previously, when faced with bad terrain, hill-climbing algorithm suffers from certain shortcomings.

Site: Follow: Share:
Open / Close