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

org.optaplanner.examples.travelingtournament.benchmark.travelingTournamentBenchmarkConfig.xml Maven / Gradle / Ivy

Go to download

OptaPlanner solves planning problems. This lightweight, embeddable planning engine implements powerful and scalable algorithms to optimize business resource scheduling and planning. This module contains the examples which demonstrate how to use it in a normal Java application.

There is a newer version: 9.44.0.Final
Show newest version
<?xml version="1.0" encoding="UTF-8"?>
<plannerBenchmark>
  <benchmarkDirectory>local/data/travelingtournament</benchmarkDirectory>
  <parallelBenchmarkCount>AUTO</parallelBenchmarkCount>
  <warmUpSecondsSpend>30</warmUpSecondsSpend>

  <inheritedSolverBenchmark>
    <problemBenchmarks>
      <xstreamAnnotatedClass>org.optaplanner.examples.travelingtournament.domain.TravelingTournament</xstreamAnnotatedClass>
      <inputSolutionFile>data/travelingtournament/unsolved/1-nl14.xml</inputSolutionFile>
      <problemStatisticType>BEST_SCORE</problemStatisticType>
    </problemBenchmarks>
    <solver>
      <solutionClass>org.optaplanner.examples.travelingtournament.domain.TravelingTournament</solutionClass>
      <planningEntityClass>org.optaplanner.examples.travelingtournament.domain.Match</planningEntityClass>
      <scoreDirectorFactory>
        <scoreDefinitionType>HARD_SOFT</scoreDefinitionType>
        <scoreDrl>/org/optaplanner/examples/travelingtournament/solver/travelingTournamentScoreRules.drl</scoreDrl>
      </scoreDirectorFactory>
      <termination>
        <maximumHoursSpend>2</maximumHoursSpend>
        <!--<maximumMinutesSpend>10</maximumMinutesSpend>-->
      </termination>
    </solver>
  </inheritedSolverBenchmark>

  <solverBenchmark>
    <name>tabuSearch</name>
    <solver>
      <localSearch>
        <unionMoveSelector>
          <swapMoveSelector>
            <cacheType>PHASE</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <filterClass>org.optaplanner.examples.travelingtournament.solver.move.factory.InverseMatchSwapMoveFilter</filterClass>
          </swapMoveSelector>
          <moveListFactory>
            <cacheType>STEP</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <moveListFactoryClass>org.optaplanner.examples.travelingtournament.solver.move.factory.MatchChainRotationsMoveFactory</moveListFactoryClass>
          </moveListFactory>
        </unionMoveSelector>
        <acceptor>
          <solutionTabuSize>1500</solutionTabuSize>
          <moveTabuSize>7</moveTabuSize>
        </acceptor>
        <forager>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>simulatedAnnealing-0hard-8000soft</name>
    <solver>
      <localSearch>
        <unionMoveSelector>
          <swapMoveSelector>
            <cacheType>PHASE</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <filterClass>org.optaplanner.examples.travelingtournament.solver.move.factory.InverseMatchSwapMoveFilter</filterClass>
          </swapMoveSelector>
          <moveListFactory>
            <cacheType>STEP</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <moveListFactoryClass>org.optaplanner.examples.travelingtournament.solver.move.factory.MatchChainRotationsMoveFactory</moveListFactoryClass>
          </moveListFactory>
        </unionMoveSelector>
        <acceptor>
          <simulatedAnnealingStartingTemperature>0hard/8000soft</simulatedAnnealingStartingTemperature>
          <!--<entityTabuSize>5</entityTabuSize>-->
        </acceptor>
        <forager>
          <!--<pickEarlyType>FIRST_BEST_SCORE_IMPROVING</pickEarlyType>-->
          <acceptedCountLimit>4</acceptedCountLimit>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>simulatedAnnealing-0hard-10000soft</name>
    <solver>
      <localSearch>
        <unionMoveSelector>
          <swapMoveSelector>
            <cacheType>PHASE</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <filterClass>org.optaplanner.examples.travelingtournament.solver.move.factory.InverseMatchSwapMoveFilter</filterClass>
          </swapMoveSelector>
          <moveListFactory>
            <cacheType>STEP</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <moveListFactoryClass>org.optaplanner.examples.travelingtournament.solver.move.factory.MatchChainRotationsMoveFactory</moveListFactoryClass>
          </moveListFactory>
        </unionMoveSelector>
        <acceptor>
          <simulatedAnnealingStartingTemperature>0hard/10000soft</simulatedAnnealingStartingTemperature>
          <!--<entityTabuSize>5</entityTabuSize>-->
        </acceptor>
        <forager>
          <!--<pickEarlyType>FIRST_BEST_SCORE_IMPROVING</pickEarlyType>-->
          <acceptedCountLimit>4</acceptedCountLimit>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <solverBenchmark>
    <name>simulatedAnnealing-2hard-10000soft</name>
    <solver>
      <localSearch>
        <unionMoveSelector>
          <swapMoveSelector>
            <cacheType>PHASE</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <filterClass>org.optaplanner.examples.travelingtournament.solver.move.factory.InverseMatchSwapMoveFilter</filterClass>
          </swapMoveSelector>
          <moveListFactory>
            <cacheType>STEP</cacheType>
            <selectionOrder>SHUFFLED</selectionOrder>
            <moveListFactoryClass>org.optaplanner.examples.travelingtournament.solver.move.factory.MatchChainRotationsMoveFactory</moveListFactoryClass>
          </moveListFactory>
        </unionMoveSelector>
        <acceptor>
          <simulatedAnnealingStartingTemperature>2hard/10000soft</simulatedAnnealingStartingTemperature>
          <!--<entityTabuSize>5</entityTabuSize>-->
        </acceptor>
        <forager>
          <!--<pickEarlyType>FIRST_BEST_SCORE_IMPROVING</pickEarlyType>-->
          <acceptedCountLimit>4</acceptedCountLimit>
        </forager>
      </localSearch>
    </solver>
  </solverBenchmark>
  <!--<solverBenchmark>-->
    <!--<name>deciderScoreComparatorFactory-SHIFTING_HARD_PENALTY</name>-->
    <!--<solver>-->
      <!--<localSearch>-->
        <!--<unionMoveSelector>-->
          <!--<swapMoveSelector>-->
            <!--<cacheType>PHASE</cacheType>-->
            <!--<selectionOrder>SHUFFLED</selectionOrder>-->
            <!--<filterClass>org.optaplanner.examples.travelingtournament.solver.move.factory.InverseMatchSwapMoveFilter</filterClass>-->
          <!--</swapMoveSelector>-->
          <!--<moveListFactory>-->
            <!--<cacheType>STEP</cacheType>-->
            <!--<selectionOrder>SHUFFLED</selectionOrder>-->
            <!--<moveListFactoryClass>org.optaplanner.examples.travelingtournament.solver.move.factory.MatchChainRotationsMoveFactoryeListFactoryClass>-->
          <!--</moveListFactory>-->
        <!--</unionMoveSelector>-->
        <!--<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>-->
        <!--</forager>-->
      <!--<localSearch>-->
    <!--</solver>-->
  <!--</solverBenchmark>-->
</plannerBenchmark>




© 2015 - 2024 Weber Informatics LLC | Privacy Policy