All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.drools.planner.examples.pas.benchmark.patientAdmissionScheduleBenchmarkConfig.xml Maven / Gradle / Ivy

Go to download

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/pas</benchmarkDirectory>
  <warmUpSecondsSpend>30</warmUpSecondsSpend>

  <inheritedSolverBenchmark>
    <problemBenchmarks>
      <xstreamAnnotatedClass>org.drools.planner.examples.pas.domain.PatientAdmissionSchedule</xstreamAnnotatedClass>
      <inputSolutionFile>data/pas/unsolved/testdata01.xml</inputSolutionFile>
      <inputSolutionFile>data/pas/unsolved/testdata02.xml</inputSolutionFile>
      <inputSolutionFile>data/pas/unsolved/testdata03.xml</inputSolutionFile>
      <!--<inputSolutionFile>data/pas/unsolved/testdata04.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata05.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata06.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata07.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata08.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata09.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata10.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata11.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata12.xml</inputSolutionFile>-->
      <!--<inputSolutionFile>data/pas/unsolved/testdata13.xml</inputSolutionFile>-->
      <problemStatisticType>BEST_SOLUTION_CHANGED</problemStatisticType>
    </problemBenchmarks>

    <solver>
      <solutionClass>org.drools.planner.examples.pas.domain.PatientAdmissionSchedule</solutionClass>
      <planningEntityClass>org.drools.planner.examples.pas.domain.BedDesignation</planningEntityClass>
      <scoreDrl>/org/drools/planner/examples/pas/solver/patientAdmissionScheduleBaseScoreRules.drl</scoreDrl>
      <!-- TODO SameBedInSameNightScoreRule should only be checked for construction heuristics -->
      <scoreDirectorFactory>
        <scoreDefinitionType>HARD_AND_SOFT</scoreDefinitionType>
        <scoreDrl>/org/drools/planner/examples/pas/solver/patientAdmissionScheduleSameBedInSameNightScoreRule.drl</scoreDrl>
      </scoreDirectorFactory>
      <termination>
        <!--
           On Geoffrey De Smet's PC: 372 (short run), 3720 (long run).
           On Peter Demeester's PC: 300 (short run), 3000 (long run).
        -->
        <maximumSecondsSpend>3720</maximumSecondsSpend>
      </termination>
    </solver>
  </inheritedSolverBenchmark>

  <solverBenchmark>
    <name>SolutionInitializer</name>
    <solver>
      <customSolverPhase>
        <customSolverPhaseCommandClass>org.drools.planner.examples.pas.solver.solution.initializer.PatientAdmissionScheduleSolutionInitializer</customSolverPhaseCommandClass>
      </customSolverPhase>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>FIRST_FIT</name>
    <solver>
      <constructionHeuristic>
        <constructionHeuristicType>FIRST_FIT</constructionHeuristicType>
        <constructionHeuristicPickEarlyType>FIRST_LAST_STEP_SCORE_EQUAL_OR_IMPROVING</constructionHeuristicPickEarlyType>
      </constructionHeuristic>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>FIRST_FIT_DECREASING</name>
    <solver>
      <constructionHeuristic>
        <constructionHeuristicType>FIRST_FIT_DECREASING</constructionHeuristicType>
        <constructionHeuristicPickEarlyType>FIRST_LAST_STEP_SCORE_EQUAL_OR_IMPROVING</constructionHeuristicPickEarlyType>
      </constructionHeuristic>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>BEST_FIT</name>
    <solver>
      <constructionHeuristic>
        <constructionHeuristicType>BEST_FIT</constructionHeuristicType>
        <constructionHeuristicPickEarlyType>FIRST_LAST_STEP_SCORE_EQUAL_OR_IMPROVING</constructionHeuristicPickEarlyType>
      </constructionHeuristic>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>BEST_FIT_DECREASING</name>
    <solver>
      <constructionHeuristic>
        <constructionHeuristicType>BEST_FIT_DECREASING</constructionHeuristicType>
        <constructionHeuristicPickEarlyType>FIRST_LAST_STEP_SCORE_EQUAL_OR_IMPROVING</constructionHeuristicPickEarlyType>
      </constructionHeuristic>
    </solver>
  </solverBenchmark>

  <!--<solverBenchmark>-->
    <!--<name>basis</name>-->
    <!--<solver>-->
      <!--<localSearch>-->
        <!--<selector>-->
          <!--<selector>-->
            <!--<moveFactoryClass>org.drools.planner.examples.pas.solver.move.factory.BedDesignationPillarPartSwapMoveFactorymoveFactoryClass>-->
          <!--</selector>-->
        <!--</selector>-->
        <!--<acceptor>-->
          <!--<solutionTabuSize>1000</solutionTabuSize>-->
          <!--<undoMoveTabuSize>3</undoMoveTabuSize>-->
        <!--</acceptor>-->
        <!--<forager>-->
          <!--<pickEarlyType>NEVER</pickEarlyType>-->
          <!--<minimalAcceptedSelection>500</minimalAcceptedSelection>&lt;!&ndash; TODO tweak me &ndash;&gt;-->
        <!--</forager>-->
      <!--</localSearch>-->
    <!--</solver>-->
  <!--</solverBenchmark>-->
</plannerBenchmark>




© 2015 - 2024 Weber Informatics LLC | Privacy Policy