|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Acceptor
.DeciderScoreComparatorFactory
.Forager
.Score
.ScoreDefinition
.Selector
.Termination
.Decider
.ProblemFactChange
to be processed.
Solver
encounters.SolverPhase
which uses the brute force algorithm.Termination.calculateSolverTimeGradient(DefaultSolverScope)
.
Termination.calculateSolverTimeGradient(DefaultSolverScope)
.
Solver
when the solution needs to be cloned,
for example to store a clone of the current solution as the best solution.
SolverPhase
which uses the brute force algorithmBruteForceSolverPhase
.CustomSolverPhase
.Decider
.GreedyFitSolverPhase
.HardAndSoftLongScore
.HardAndSoftScore
.LocalSearchSolverPhase
.SimpleDoubleScore
.SimpleScore
.SolutionDirector
.Solver
.Solution
and its WorkingMemory
accordingly.
Solution
and its WorkingMemory
accordingly.
Solver
when the Solution
needs to be inserted into an empty WorkingMemory.
Solution
that is used in the WorkingMemory
.
SolverPhase
which uses the greedy algorithm, which is a construction heuristic.SolverPhase
after every step to determine if the search should stop.
Solver
after every phase to determine if the search should stop.
SimulatedAnnealingAcceptor
is always better.SolverPhase
which uses a local search algorithm,
such as tabu search, simulated annealing, ...DeciderScoreComparatorFactory
.Solution
is a collection of planning entities.Solution
is a planning entity.PlanningEntityDifficultyWeightFactory
.PlanningValueStrengthWeightFactory
.Solution
.Solver
when the Score of this Solution has been calculated.
Score
of that Solution
.Solver
or a SolverPhase
should stop.Solution
.Solver
.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |