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

org.drools.planner.examples.travelingtournament.benchmark.smart.smartTravelingTournamentBenchmarkConfig.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/travelingtournament/smart</benchmarkDirectory>
  <warmUpSecondsSpend>30</warmUpSecondsSpend>

  <inheritedSolverBenchmark>
    <problemBenchmarks>
      <xstreamAnnotatedClass>org.drools.planner.examples.travelingtournament.domain.TravelingTournament</xstreamAnnotatedClass>
      <inputSolutionFile>data/travelingtournament/smart/unsolved/1-nl14.xml</inputSolutionFile>
      <problemStatisticType>BEST_SOLUTION_CHANGED</problemStatisticType>
    </problemBenchmarks>
    <solver>
      <solutionClass>org.drools.planner.examples.travelingtournament.domain.TravelingTournament</solutionClass>
      <planningEntityClass>org.drools.planner.examples.travelingtournament.domain.Match</planningEntityClass>
      <scoreDirectorFactory>
        <scoreDefinitionType>HARD_AND_SOFT</scoreDefinitionType>
        <scoreDrl>/org/drools/planner/examples/travelingtournament/solver/smart/smartTravelingTournamentScoreRules.drl</scoreDrl>
      </scoreDirectorFactory>
      <termination>
        <maximumHoursSpend>2</maximumHoursSpend>
        <!--<maximumMinutesSpend>10</maximumMinutesSpend>-->
      </termination>
    </solver>
  </inheritedSolverBenchmark>

  <solverBenchmark>
    <name>tabuSearch</name>
    <solver>
      <localSearch>
        <selector>
          <moveFactoryClass>org.drools.planner.examples.travelingtournament.solver.smart.move.factory.SmartTravelingTournamentMoveFactory</moveFactoryClass>
        </selector>
        <acceptor>
          <solutionTabuSize>1500</solutionTabuSize>
          <moveTabuSize>7</moveTabuSize>
        </acceptor>
        <forager>
          <pickEarlyType>NEVER</pickEarlyType>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>simulatedAnnealing-0hard-8000soft</name>
    <solver>
      <localSearch>
        <selector>
          <moveFactoryClass>org.drools.planner.examples.travelingtournament.solver.smart.move.factory.SmartTravelingTournamentMoveFactory</moveFactoryClass>
        </selector>
        <acceptor>
          <simulatedAnnealingStartingTemperature>0hard/8000soft</simulatedAnnealingStartingTemperature>
          <!--<planningEntityTabuSize>5</planningEntityTabuSize>-->
        </acceptor>
        <forager>
          <!--<pickEarlyType>FIRST_BEST_SCORE_IMPROVING</pickEarlyType>-->
          <minimalAcceptedSelection>4</minimalAcceptedSelection>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>simulatedAnnealing-0hard-10000soft</name>
    <solver>
      <localSearch>
        <selector>
          <moveFactoryClass>org.drools.planner.examples.travelingtournament.solver.smart.move.factory.SmartTravelingTournamentMoveFactory</moveFactoryClass>
        </selector>
        <acceptor>
          <simulatedAnnealingStartingTemperature>0hard/10000soft</simulatedAnnealingStartingTemperature>
          <!--<planningEntityTabuSize>5</planningEntityTabuSize>-->
        </acceptor>
        <forager>
          <!--<pickEarlyType>FIRST_BEST_SCORE_IMPROVING</pickEarlyType>-->
          <minimalAcceptedSelection>4</minimalAcceptedSelection>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>simulatedAnnealing-2hard-10000soft</name>
    <solver>
      <localSearch>
        <selector>
          <moveFactoryClass>org.drools.planner.examples.travelingtournament.solver.smart.move.factory.SmartTravelingTournamentMoveFactory</moveFactoryClass>
        </selector>
        <acceptor>
          <simulatedAnnealingStartingTemperature>2hard/10000soft</simulatedAnnealingStartingTemperature>
          <!--<planningEntityTabuSize>5</planningEntityTabuSize>-->
        </acceptor>
        <forager>
          <!--<pickEarlyType>FIRST_BEST_SCORE_IMPROVING</pickEarlyType>-->
          <minimalAcceptedSelection>4</minimalAcceptedSelection>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <!--<solverBenchmark>-->
    <!--<name>deciderScoreComparatorFactory-SHIFTING_HARD_PENALTY</name>-->
    <!--<solver>-->
      <!--<localSearch>-->
        <!--<selector>-->
          <!--<moveFactoryClass>org.drools.planner.examples.travelingtournament.solver.smart.move.factory.SmartTravelingTournamentMoveFactory</moveFactoryClass>-->
        <!--</selector>-->
        <!--<acceptor>-->
          <!--<solutionTabuSize>1500</solutionTabuSize>-->
          <!--<moveTabuSize>7</moveTabuSize>-->
        <!--</acceptor>-->
        <!--<forager>-->
          <!--<deciderScoreComparatorFactory>-->
            <!--<deciderScoreComparatorFactoryType>SHIFTING_HARD_PENALTY</deciderScoreComparatorFactoryType>-->
            <!--<hardScoreActivationThreshold>0</hardScoreActivationThreshold>-->
            <!--<successiveNoHardChangeMinimum>2</successiveNoHardChangeMinimum>-->
            <!--<successiveNoHardChangeMaximum>20</successiveNoHardChangeMaximum>-->
            <!--<successiveNoHardChangeRepetitionMultiplicand>20.0</successiveNoHardChangeRepetitionMultiplicand>-->
            <!--<hardWeightSurvivalRatio>0.5</hardWeightSurvivalRatio>-->
            <!--<startingHardWeight>1000</startingHardWeight>-->
          <!--</deciderScoreComparatorFactory>-->
          <!--<pickEarlyType>NEVER</pickEarlyType>-->
        <!--</forager>-->
      <!--<localSearch>-->
    <!--</solver>-->
  <!--</solverBenchmark>-->
</plannerBenchmark>




© 2015 - 2024 Weber Informatics LLC | Privacy Policy