Repository navigation
perf: allow bavet score calculation to exit early if it can prove the move cannot be accepted - #2694
Christopher-Chianelli wants to merge 15 commits into
Conversation
0a41eaf to
de33f7f
Compare
de33f7f to
1b37495
Compare
1b37495 to
913ce43
Compare
triceo
left a comment
There was a problem hiding this comment.
See my comments on Enterprise.
|
This pull request, as it stands, would leave the Solver documentation stale in the place below. An automated check found it and can be wrong.
{property_prefix}timefold.solver.{solver_name_prefix}constraint-stream-tiered-score-calculation::
Enable xref:commercial-editions/performance-improvements.adoc#tieredScoreCalculation[tiered score calculation] to skip constraints of softer score levels when they cannot change whether a move is accepted.
Enabled by default in Timefold Solver Enterprise Edition.Separately, the new section in The docs live in A new commit on the branch updates this comment, and drift that is still there when the group merges gets a docs pull request against Generated by Solver Docs Drift Review with Claude. |
54fdd9f to
c6e5ee1
Compare
… move cannot be accepted When enabled via its preview feature, Construction Heuristic's Forager and Local Search's Decider give infomation to the ScoreDirector about the lowest score move it would accept. If after computing a level node network, the score calculator could prove the resulting score would be lower than the minimum score, it skips applying the move to the later levels' node networks.
…rector configuration
…treamScoreDirectorFactory
Fixes a partial score being consumed in `stepEnded()` and friends when a bailout occurs.
…ut a constraint provider
c6e5ee1 to
c4b67f7
Compare
| this.indictmentsEnabled = indictmentsEnabled; | ||
| this.entityDescriptorToForEachCriteriaToPredicateMap = new HashMap<>(); | ||
| this.streamToProfileIdSets = HashMap.newHashMap(Math.max(16, activeStreamSet.size() / 2)); | ||
| this.networkId = networkId; |
There was a problem hiding this comment.
Please double-check that the network visualization in case of tiered still produces meaningful output.
When enabled via its preview feature,
Construction Heuristic's Forager and Local Search's Decider give infomation to the ScoreDirector about the lowest score move it would accept. If after computing a level node network, the score calculator could prove the resulting score would be lower than the minimum score, it skips applying the move to the later levels' node networks.