package

es.usc.citius.hipster.algorithm.localsearch

Implementation of local search algorithms (such as hill climbing).

Interfaces

AnnealingSearch.AcceptanceProbability Interface to compute the acceptance probability. 
AnnealingSearch.SuccessorFinder<A, S, N extends Node<A, S, N>> Interface to find the successor of a node. 

Classes

AnnealingSearch<A, S, N extends HeuristicNode<A, S, Double, N>> Implementation of the simulated annealing search that is a probabilistic technique for approximating the global optimum of a given function. 
AnnealingSearch.ASIterator  
HillClimbing<A, S, C extends Comparable<C>, N extends HeuristicNode<A, S, C, N>> Implementation of the Hill Climbing algorithm. 
HillClimbing.EHCIterator