MDEOptimiser implementation of CPS benchmark

1 files changed, 41 insertions, 0 deletions

diff --git a/Domains/hu.bme.mit.inf.dslreasoner.domains.cps/src/hu/bme/mit/inf/dslreasoner/domains/cps/mdeo/cps.mopt b/Domains/hu.bme.mit.inf.dslreasoner.domains.cps/src/hu/bme/mit/inf/dslreasoner/domains/cps/mdeo/cps.mopt
new file mode 100644
index 00000000..4c05939d
--- /dev/null
+++ b/Domains/hu.bme.mit.inf.dslreasoner.domains.cps/src/hu/bme/mit/inf/dslreasoner/domains/cps/mdeo/cps.mopt
@@ -0,0 +1,41 @@
+problem {
+        basepath <model>
+        metamodel <hu.bme.mit.inf.dslreasoner.domains.cps.CpsPackage>
+        model <problem.xmi>
+}
+
+goal {
+        objective TotalCost minimise java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.TotalCostFitnessFunction" }
+        constraint NotSatisfiedRequriements java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.NotSatisfiedRequirementsConstraint" }
+        constraint NotAllocatedAppInstances java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.NotAllocatedAppInstancesConstraint" }
+        constraint NonRedundantAllocations java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.NonRedundantAllocationsConstraint" }
+        constraint UnavailableMemory java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.UnavailableMemoryConstraint" }
+        constraint UnavailableHdd java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.UnavailableHddConstraint" }
+        constraint TooLowAverageMemory java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.TooLowAverageMemoryConstraint" }
+        constraint TooLowAverageHdd java { "hu.bme.mit.inf.dslreasoner.domains.cps.mdeo.TooLowAverageHddConstraint" }
+}
+
+search {
+//      mutate using <cps.henshin> unit "createAppInstance"
+//      mutate using <cps.henshin> unit "createHostInstance"
+//      mutate using <cps.henshin> unit "allocate"
+//      mutate using <cps.henshin> unit "deleteAppInstance"
+//      mutate using <cps.henshin> unit "unallocate"
+        mutate { "ApplicationInstance" }
+        mutate { "HostInstance" }
+}
+
+solver {
+        optimisation provider moea algorithm NSGAII {
+                variation: mutation
+                population: 25
+                mutation.step: 3
+                mutation.strategy: random
+        }
+
+        termination {
+                time: 120
+        }
+
+        batches 1
+}