|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Acceptor
.DeciderScoreComparatorFactory
.EntitySelector
.Forager
.IncrementalScoreCalculator
.MoveSelector
.Placer
.Score
.ScoreDefinition
.ScoreDirector
.ScoreDirectorFactory
.ScoreHolder
.Selector
.Termination
.ValueSelector
.Decider
.ProblemFactChange
to be processed.
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,
it would be equal to the parameter workingScore.
Solution
is found.
Solver
encounters.BruteForceSolverPhase
is a SolverPhase
which uses the brute force algorithm.ScoreDirector
instance.
ScoreHolder
is dead
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.Solver
when the solution needs to be cloned,
for example to store a clone of the current solution as the best solution.
CloudBalance.processList
.
CurriculumCourseSchedule.lectureList
.
Examination.examList
.
MachineReassignment.processAssignmentList
.
Manners2009.seatDesignationList
.
NQueens.queenList
.
NurseRoster.shiftAssignmentList
.
PatientAdmissionSchedule.bedDesignationList
.
TrainDesign.carBlockDesignationList
.
TravelingTournament.matchList
.
TravelingSalesmanTour.visitList
.
VrpSchedule.customerList
.
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
.Decider
.GreedyFitSolverPhase
.HardAndSoftLongScore
.HardAndSoftScore
.LocalSearchSolverPhase
.Solver
configurations on multiple problem instances (data sets).SimpleDoubleScore
.SimpleScore
.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
.QueuedEntityPlacerConfig
// TODO and PooledEntityPlacerConfig
.PlanningEntity
annotated class.Score
, calculated by the WorkingMemory
for DroolsScoreDirector
.
EntitySelector
's are upgraded to SelectionCacheType.STEP
.EntitySelector
implementation.ValueSelector
implementation.MoveSelector
.Solution
type potentially has its own file extension.
MoveSelector
s
s(uch as ChangeMoveSelector
and SwapMoveSelector
) already handle 1-sized chains.
DroolsScoreDirector
when the Solution
needs to be inserted
into an empty WorkingMemory
.
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
.
SolverConfig
at runtime before building the Solver
.
Solution
that is used to calculate the Score
.
SolverPhase
which uses the greedy algorithm, which is a construction heuristic.Iterator.hasNext()
.
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
.Selector.isNeverEnding()
is also true.
ProblemFactChange
s have been processed.
Solution
is feasible if it has no broken hard constraints.
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.
SimulatedAnnealingAcceptor
is always better.Iterable
interface that supports ListIterable.listIterator()
and ListIterable.listIterator(int)
.List.listIterator()
List.listIterator()
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
.Iterator.next()
.
Random.nextInt(int)
for doubles.
Random.nextInt(int)
for longs.
List
of entities that are somehow related.ValuePlacer
which fits 1 entity or value.EntityPlacerConfig
and ValuePlacerConfig
.Solution
is a collection of planning entities.Solution
is a planning entity.PlanningEntityDifficultyWeightFactory
.PlanningValueStrengthWeightFactory
.Solver
configurations.Solution
.Solution
from or to a File
.ProblemBenchmark
PillarSelector
implementation.Solution
workingSolution and calculates the score for that Solution
.ScoreDirector
.Score
.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.
Score
calculation.ScoreDirector
, which recalculates the Score
of the Solution
workingSolution every time.ScoreDirectorFactory
.Solver
configuration for 1 problem instance (data set).SingleBenchmark
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used
because the rule engine already requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used
because the rule engine already requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object)
and Object.hashCode()
cannot be used because the rule engine already
requires them (for performance in their original state).
Solver
configuration benchmarked on multiple problem instances (data sets).Solver
.Solver
or a SolverPhase
should stop.SolverBenchmarkRankingWeightFactory
orders a SolverBenchmark
by how how many time each of it's
SingleBenchmark
beat the SingleBenchmark
of the other SolverBenchmark
s.Comparator
orders a SolverBenchmark
by its total Score
.CompositeMoveSelector
that unions 2 or more MoveSelector
s.ValueRange
.Comparator
orders a SolverBenchmark
by its worst Score
.Solver
.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |