1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
package hu.bme.mit.inf.dslreasoner.viatrasolver.reasoner.dse
import java.util.HashMap
import java.util.Map
import org.eclipse.viatra.dse.api.DSEException
import org.eclipse.viatra.dse.api.Solution
import org.eclipse.viatra.dse.api.SolutionTrajectory
import org.eclipse.viatra.dse.base.ThreadContext
import org.eclipse.viatra.dse.objectives.Fitness
import org.eclipse.viatra.dse.objectives.IObjective
import org.eclipse.viatra.dse.objectives.ObjectiveComparatorHelper
import org.eclipse.viatra.dse.solutionstore.SolutionStore.ISolutionSaver
import org.eclipse.xtend.lib.annotations.Accessors
/**
* Based on {@link org.eclipse.viatra.dse.solutionstore.SolutionStore.BestSolutionSaver}.
*/
class ViatraReasonerSolutionSaver implements ISolutionSaver {
@Accessors val solutionCopier = new SolutionCopier
val boolean hasExtremalObjectives
val ObjectiveComparatorHelper comparatorHelper
val Map<SolutionTrajectory, Fitness> trajectories = new HashMap
@Accessors(PUBLIC_SETTER) var Map<Object, Solution> solutionsCollection
new(IObjective[][] leveledExtremalObjectives) {
comparatorHelper = new ObjectiveComparatorHelper(leveledExtremalObjectives)
hasExtremalObjectives = leveledExtremalObjectives.exists[!empty]
}
override saveSolution(ThreadContext context, Object id, SolutionTrajectory solutionTrajectory) {
if (hasExtremalObjectives) {
saveBestSolutionOnly(context, id, solutionTrajectory)
} else {
basicSaveSolution(context, id, solutionTrajectory)
}
}
private def saveBestSolutionOnly(ThreadContext context, Object id, SolutionTrajectory solutionTrajectory) {
val fitness = context.lastFitness
val dominatedTrajectories = newArrayList
for (entry : trajectories.entrySet) {
val isLastFitnessBetter = comparatorHelper.compare(fitness, entry.value)
if (isLastFitnessBetter < 0) {
// Found a trajectory that dominates the current one, no need to save
return false
}
if (isLastFitnessBetter > 0) {
dominatedTrajectories += entry.key
}
}
// We must save the new trajectory before removing dominated trajectories
// to avoid removing the current solution when it is reachable only via dominated trajectories.
val solutionSaved = basicSaveSolution(context, id, solutionTrajectory)
for (dominatedTrajectory : dominatedTrajectories) {
trajectories -= dominatedTrajectory
val dominatedSolution = dominatedTrajectory.solution
if (!dominatedSolution.trajectories.remove(dominatedTrajectory)) {
throw new DSEException(
"Dominated solution is not reachable from dominated trajectory. This should never happen!")
}
if (dominatedSolution.trajectories.empty) {
val dominatedSolutionId = dominatedSolution.stateCode
solutionCopier.markAsObsolete(dominatedSolutionId)
solutionsCollection -= dominatedSolutionId
}
}
solutionSaved
}
private def basicSaveSolution(ThreadContext context, Object id, SolutionTrajectory solutionTrajectory) {
val fitness = context.lastFitness
var boolean solutionSaved = false
var dseSolution = solutionsCollection.get(id)
if (dseSolution === null) {
solutionCopier.copySolution(context, id)
dseSolution = new Solution(id, solutionTrajectory)
solutionsCollection.put(id, dseSolution)
solutionSaved = true
} else {
solutionSaved = dseSolution.trajectories.add(solutionTrajectory)
}
if (solutionSaved) {
solutionTrajectory.solution = dseSolution
trajectories.put(solutionTrajectory, fitness)
}
solutionSaved
}
def isFitnessDominated(Fitness fitness) {
for (existingFitness : trajectories.values) {
val isNewFitnessBetter = comparatorHelper.compare(fitness, existingFitness)
if (isNewFitnessBetter < 0) {
return true
}
}
false
}
}
|
