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".
proposed a new immunization strategy based on a stochastic hill-climbing algorithm to create a subset of nodes whose immunization efficiently reduced the network vulnerability to worst-case epidemics [9].
Khansari, "Immunization of complex networks using stochastic hill-climbing algorithm," in Proc.
A hill-climbing algorithm is used to drop conditions until the lowest pessimistic error rate is found.
Gray and Neuhoff [8] provide a nice historical background for k-means placed in the larger context of hill-climbing algorithms.
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 original version of HSP, for example, searches the progression space with a hill-climbing algorithm and a nonadmissible heuristic derived from a relaxation where delete lists are assumed empty, and atoms are assumed independent.
A Heuristic for Domain-Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm.
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.
A Heuristic for Domain-Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm, Technical report, Institute for Computer Science, Albert-Ludwigs University.