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

org.drools.planner.examples.travelingtournament.benchmark.breakNl14BenchmarkConfig.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</benchmarkDirectory>

  <inheritedSolverBenchmark>
    <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/travelingTournamentScoreRules.drl</scoreDrl>
      </scoreDirectorFactory>
      <localSearch>
        <unionMoveSelector>
          <swapMoveSelector>
            <cacheType>PHASE</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <moveFilterClass>org.drools.planner.examples.travelingtournament.solver.move.factory.InverseMatchSwapMoveFilter</moveFilterClass>
          </swapMoveSelector>
          <moveListFactory>
            <cacheType>STEP</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <moveListFactoryClass>org.drools.planner.examples.travelingtournament.solver.move.factory.MatchChainRotationsMoveFactory</moveListFactoryClass>
          </moveListFactory>
        </unionMoveSelector>
        <acceptor>
          <solutionTabuSize>3000</solutionTabuSize>
        </acceptor>
        <forager>
        </forager>
      </localSearch>
    </solver>
  </inheritedSolverBenchmark>

  <solverBenchmark>
    <problemBenchmarks>
      <xstreamAnnotatedClass>org.drools.planner.examples.travelingtournament.domain.TravelingTournament</xstreamAnnotatedClass>
      <inputSolutionFile>data/travelingtournament/unsolved/1-nl14.xml</inputSolutionFile>
      <problemStatisticType>BEST_SOLUTION_CHANGED</problemStatisticType>
    </problemBenchmarks>
    <solver>
      <termination>
        <terminationCompositionStyle>AND</terminationCompositionStyle>
        <scoreAttained>-0hard/-188727soft</scoreAttained><!-- 188728 (Van Hentenryck and Vergados, May 18 2006) -->
        <maximumUnimprovedStepCount>20</maximumUnimprovedStepCount>
      </termination>
    </solver>
  </solverBenchmark>
</plannerBenchmark>




© 2015 - 2025 Weber Informatics LLC | Privacy Policy