|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectextended.BestChoiceStrategy<T>
T
- the specific type of all elements in the search domain.public class BestChoiceStrategy<T>
A hill climbing strategy which selects the best successor upon all successor states.
It is one of the standard HillClimbingStrategy implementations usable in the hill climbing search.
In general this strategy will produce good result in view search steps,
but is more likely to trip into local optimum during search.
In fact to compare all successor states is slow for large lists and
will produce a leak of performance for big optimization problems.
HillClimbing
,
HillClimbingStrategy
,
FirstChoiceStrategy
Constructor Summary | |
---|---|
BestChoiceStrategy()
Creates a new BestChoiceStrategy which can be employed in the hill climbing search. |
Method Summary | |
---|---|
T |
select(HillClimbing<T> hc,
java.util.List<T> list,
T current)
This method selects the best state of all states in the extension list. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public BestChoiceStrategy()
Method Detail |
---|
public T select(HillClimbing<T> hc, java.util.List<T> list, T current)
select
in interface HillClimbingStrategy<T>
hc
- the hill climbing search itself (which must be used as a comparator)list
- the list of successors of the current statecurrent
- the current state of the hill climbing search
HillClimbingStrategy.select(extended.HillClimbing, java.util.List, java.lang.Object)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |