org.drools.planner.examples.machinereassignment.benchmark.machineReassignmentBenchmarkConfigTemplate.xml.ftl Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of drools-planner-examples Show documentation
Drools Planner optimizes automated planning by combining metaheuristic search algorithms with rule engine powered score calculation. This is the drools-planner-examples module which contains examples on how to use Drools Planner.
There is a newer version: 6.0.0.Alpha9
Show newest version
<?xml version="1.0" encoding="UTF-8"?>
<plannerBenchmark>
  <benchmarkDirectory>local/data/machinereassignment/template</benchmarkDirectory>
  <!--<parallelBenchmarkCount>AUTO</parallelBenchmarkCount>-->
  <warmUpSecondsSpend>30</warmUpSecondsSpend>

  <inheritedSolverBenchmark>
    <problemBenchmarks>
      <problemIOClass>org.drools.planner.examples.machinereassignment.persistence.MachineReassignmentProblemIO</problemIOClass>
      <!--<inputSolutionFile>data/machinereassignment/input/model_a1_1.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a1_2.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a1_3.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a1_4.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a1_5.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a2_1.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a2_2.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a2_3.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a2_4.txt</inputSolutionFile>-->
      <!--<inputSolutionFile>data/machinereassignment/input/model_a2_5.txt</inputSolutionFile>-->
      <inputSolutionFile>data/machinereassignment/input/model_b_1.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_2.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_3.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_4.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_5.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_6.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_7.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_8.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_9.txt</inputSolutionFile>
      <inputSolutionFile>data/machinereassignment/input/model_b_10.txt</inputSolutionFile>
      <!--<problemStatisticType>BEST_SOLUTION_CHANGED</problemStatisticType>-->
      <!--<problemStatisticType>CALCULATE_COUNT_PER_SECOND</problemStatisticType>-->
      <!--<problemStatisticType>MEMORY_USE</problemStatisticType>-->
    </problemBenchmarks>

    <solver>
      <!--<environmentMode>DEBUG</environmentMode>-->
      <solutionClass>org.drools.planner.examples.machinereassignment.domain.MachineReassignment</solutionClass>
      <planningEntityClass>org.drools.planner.examples.machinereassignment.domain.MrProcessAssignment</planningEntityClass>

      <scoreDirectorFactory>
        <scoreDefinitionType>HARD_AND_SOFT_LONG</scoreDefinitionType>
        <incrementalScoreCalculatorClass>org.drools.planner.examples.machinereassignment.solver.score.MachineReassignmentIncrementalScoreCalculator</incrementalScoreCalculatorClass>
        <!--<scoreDrl>/org/drools/planner/examples/machinereassignment/solver/machineReassignmentScoreRules.drl</scoreDrl>-->
      </scoreDirectorFactory>
      <termination>
        <maximumMinutesSpend>5</maximumMinutesSpend>
      </termination>
    </solver>
  </inheritedSolverBenchmark>

  <solverBenchmark>
    <name>original</name>
    <solver>
      <customSolverPhase>
        <customSolverPhaseCommandClass>org.drools.planner.examples.machinereassignment.solver.solution.initializer.MrOriginalMachineSolutionInitializer</customSolverPhaseCommandClass>
      </customSolverPhase>
    </solver>
  </solverBenchmark>
<#list [500, 1000, 2000, 4000] as minimalAcceptedSelection>
<#list [5, 7, 9, 11] as planningEntityTabuSize>
    <solverBenchmark>
    <name>entityTabu${planningEntityTabuSize}-mas${minimalAcceptedSelection}</name>
    <solver>
      <customSolverPhase>
        <customSolverPhaseCommandClass>org.drools.planner.examples.machinereassignment.solver.solution.initializer.MrOriginalMachineSolutionInitializer</customSolverPhaseCommandClass>
      </customSolverPhase>
      <localSearch>
        <unionMoveSelector>
          <changeMoveSelector/>
          <swapMoveSelector/>
        </unionMoveSelector>
        <acceptor>
          <planningEntityTabuSize>${planningEntityTabuSize}</planningEntityTabuSize>
        </acceptor>
        <forager>
          <minimalAcceptedSelection>${minimalAcceptedSelection}</minimalAcceptedSelection>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
</#list>
<#list [500, 1000, 2000, 4000] as lateAcceptanceSize>
    <solverBenchmark>
    <name>lateAcceptance${lateAcceptanceSize}-mas${minimalAcceptedSelection}</name>
    <solver>
      <customSolverPhase>
        <customSolverPhaseCommandClass>org.drools.planner.examples.machinereassignment.solver.solution.initializer.MrOriginalMachineSolutionInitializer</customSolverPhaseCommandClass>
      </customSolverPhase>
      <localSearch>
        <unionMoveSelector>
          <changeMoveSelector/>
          <swapMoveSelector/>
        </unionMoveSelector>
        <acceptor>
          <lateAcceptanceSize>${lateAcceptanceSize}</lateAcceptanceSize>
        </acceptor>
        <forager>
          <minimalAcceptedSelection>${minimalAcceptedSelection}</minimalAcceptedSelection>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
</#list>
</#list>
</plannerBenchmark>