|
OptaPlanner core 6.0.0.Final | |||||||||
PREV NEXT | FRAMES NO FRAMES |
Acceptor
.DeciderScoreComparatorFactory
.EntityPlacer
.EntitySelector
.Forager
.IncrementalScoreCalculator
.MoveSelector
.PlanningVariableListener
.Score
.ScoreDefinition
.ScoreDirector
.ScoreDirectorFactory
.ScoreHolder
.Selector
.Termination
.ValueSelector
.Move
.ProblemFactChange
to be processed.
Score
is calculated for the current workingSolution
in the current ScoreDirector
(with possibly incremental calculation residue),
it is equal to the parameter expectedWorkingScore
.
Score
is calculated for the parameter solution,
it would be equal to the Solution.getScore()
of that parameter.
Score
is calculated for the current workingSolution
in a fresh ScoreDirector
(with no incremental calculation residue),
it is equal to the parameter workingScore
.
Score
is based on n levels of int constraints.Solution
is found.
Solver
encounters.BruteForceSolverPhase
is a SolverPhase
which uses the brute force algorithm.ScoreDirector
instance.
Solver
instance.
Iterator
does not shuffle and is never ending.EntitySelector
that caches the result of its child EntitySelector
.MoveSelector
that caches the result of its child MoveSelector
.ValueSelector
that caches the result of its child ValueSelector
.Termination.calculateSolverTimeGradient(DefaultSolverScope)
.
Score
and updates the workingSolution
accordingly.
Termination.calculateSolverTimeGradient(DefaultSolverScope)
.
CompositeMoveSelector
that cartesian products 2 or more MoveSelector
s.ScoreDirector
and its workingSolution
.
MoveSelector
.ConstructionHeuristicSolverPhase
is a SolverPhase
which uses a construction heuristic algorithm,
such as first fit, best fit decreasing, cheapest insertion, ...SelectionCacheType
.
SelectionCacheType
.
SelectionCacheType
.
CustomSolverPhase
is a SolverPhase
which uses the brute force algorithmBruteForceSolverPhase
.ConstructionHeuristicSolverPhase
.CustomSolverPhase
.LocalSearchSolverPhase
.PropertyDescriptor
for faster and easier access.Solver
.SubChainSelector
implementation.Solution
of the ScoreDirector
and notifies the ScoreDirector
accordingly.
Solution
and its ScoreDirector
accordingly.
ScoreDirector
, which directs the Rule Engine to calculate the Score
of the Solution
workingSolution.ScoreDirectorFactory
.Selector.isNeverEnding()
is true, then Iterable.iterator()
will never end.
QueuedEntityPlacerConfig
// TODO and PooledEntityPlacerConfig
.PlanningEntity
annotated class.Score
, calculated by the KieSession
for DroolsScoreDirector
.
Score
that supports FeasibilityScore.isFeasible()
.HardSoftScore
s based on the calculation of the hard multiplied by a weight, summed with the soft.String
representation of the Score
.
ValueSelector
implementation.EntitySelector
implementation.ValueSelector
implementation.MoveSelector
.SelectionCacheType.JUST_IN_TIME
,
even if a selector child caches.
Score
of ScoreHolder.extractScore()
.
Solution
type potentially has its own file extension.
MoveSelector
s
s(uch as ChangeMoveSelector
and SwapMoveSelector
) already handle 1-sized chains.
Score
is the Score
of which there is no better in any problem instance.
Score
is the Score
of which there is no worse in any problem instance.
DroolsScoreDirector
when the Solution
needs to be inserted
into an empty KieSession
.
Class
of the actual Score
implementation
Selector
with Selector.isNeverEnding()
true should return a size
as if it would be able to return each distinct element only once,
because the size can be used in SelectionProbabilityWeightFactory
.
IterableSelector.getSize()
, but requires an entity.
SolverConfig
at runtime before building the Solver
.
ConstructionHeuristicStepScope.isBestSolutionCloningDelayed()
returns true
Solution
that is used to calculate the Score
.
Score
is based on 3 levels of int constraints: hard, medium and soft.Score
is based on 2 levels of BigDecimal
constraints: hard and soft.Score
is based on 2 levels of double constraints: hard and soft.Score
is based on 2 levels of long constraints: hard and soft.Score
is based on 2 levels of int constraints: hard and soft.Score
calculation.ScoreDirector
, which only recalculates the Score
of the part of the Solution
workingSolution that changed,
instead of the going through the entire Solution
.ScoreDirectorFactory
.ValueSelector
applies to) and that is uninitialized too.ScoreDirector.isConstraintMatchEnabled()
for the ScoreDirector
which contains this ScoreHolder
.
Selector.isNeverEnding()
is also true.
ProblemFactChange
s have been processed.
Solution
is feasible if it has no broken hard constraints.
Solution
is feasible if it has no broken hard constraints.
PlanningVariable.nullable()
value is always considered initialized, but it can still be reinitialized
with PlanningVariable.reinitializeVariableEntityFilter()
.
Selector.isContinuous()
is true
or if this selector is in random order (for most cases).
SolverPhase
after every step and every move to determine if the search should stop.
Solver
after every phase to determine if the search should stop.
Iterable.iterator()
, but requires an entity.
SimulatedAnnealingAcceptor
is always better.Iterable
interface that supports ListIterable.listIterator()
and ListIterable.listIterator(int)
.List.listIterator()
List.listIterator()
LocalSearchSolverPhase
is a SolverPhase
which uses a local search algorithm,
such as tabu search, simulated annealing, ...Solution
.Iterator
of custom Move
s.MoveIteratorFactory
to a MoveSelector
.List
of custom Move
s.MoveListFactory
to a MoveSelector
.Move
s.ChangeMoveSelectorConfig
, etc.DeciderScoreComparatorFactory
.Random.nextInt(int)
for doubles.
Random.nextInt(int)
for longs.
PlanningVariable.nullable()
.String
and returns a Score
.
List
of entities that are somehow related.Solution
that implements its own planning cloning
instead of letting the default or a custom SolutionCloner
do it.Solution
is a collection of planning entities.Solution
is a planning entity.Solution
.Solution
from or to a File
.PropertyDescriptor
for faster and easier access.PillarSelector
implementation.Score
s and what the perfect maximum/minimum Score
is.workingSolution
and calculates the Score
for that Solution
.ScoreDirector
.DroolsScoreDirector
into the Drools DRL.PlanningEntity
, a planningValue, a Move
or a Selector
).PlanningEntity
, a planningValue, a Move
or a Selector
).List
of selection
(which is a PlanningEntity
, a planningValue, a Move
or a Selector
).PlanningEntity
, a planningValue, a Move
or a Selector
).MoveSelector
, EntitySelector
and ValueSelector
which generates Move
s or parts of them.MoveSelectorConfig
, EntitySelectorConfig
and ValueSelectorConfig
.Solver
when the Score of this Solution has been calculated.
workingSolution
must never be the same instance as the bestSolution
,
it should be a (un)changed clone.
Score
is based on 1 level of BigDecimal
constraints.Score
is based on 1 level of double constraints.Score
is based on 1 level of long constraints.Score
is based on 1 level of int constraints.Score
calculation.ScoreDirector
, which recalculates the Score
of the Solution
workingSolution every time.ScoreDirectorFactory
.Solution
during planning.Solver
.Solver
or a SolverPhase
should stop.CompositeMoveSelector
that unions 2 or more MoveSelector
s.Selector
's Iterator.hasNext()
or Iterator.next()
methods,
because that can cause descendant Selector
s to be selected too early
(which breaks MimicReplayingEntitySelector
).FieldAccessingSolutionCloner.FieldAccessingSolutionClonerRun.isFieldAnEntityPropertyOnSolution(java.lang.reflect.Field)
assumptions were wrong.
BendableScore
.
Solver
.
|
OptaPlanner core 6.0.0.Final | |||||||||
PREV NEXT | FRAMES NO FRAMES |