org.drools.planner.examples.nurserostering.benchmark.nurseRosteringLongBenchmarkConfig.xml Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of drools-planner-examples Show documentation
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.
<?xml version="1.0" encoding="UTF-8"?> <plannerBenchmark> <benchmarkDirectory>local/data/nurserostering/long</benchmarkDirectory> <parallelBenchmarkCount>AUTO</parallelBenchmarkCount> <warmUpSecondsSpend>30</warmUpSecondsSpend> <inheritedSolverBenchmark> <problemBenchmarks> <xstreamAnnotatedClass>org.drools.planner.examples.nurserostering.domain.NurseRoster</xstreamAnnotatedClass> <inputSolutionFile>data/nurserostering/unsolved/long01.xml</inputSolutionFile> <inputSolutionFile>data/nurserostering/unsolved/long02.xml</inputSolutionFile> <!--<inputSolutionFile>data/nurserostering/unsolved/long03.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long04.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long05.xml</inputSolutionFile>--> <inputSolutionFile>data/nurserostering/unsolved/long_hint01.xml</inputSolutionFile> <inputSolutionFile>data/nurserostering/unsolved/long_hint02.xml</inputSolutionFile> <!--<inputSolutionFile>data/nurserostering/unsolved/long_hint03.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long_late01.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long_late02.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long_late03.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long_late04.xml</inputSolutionFile>--> <!--<inputSolutionFile>data/nurserostering/unsolved/long_late05.xml</inputSolutionFile>--> <problemStatisticType>BEST_SOLUTION_CHANGED</problemStatisticType> </problemBenchmarks> <solver> <solutionClass>org.drools.planner.examples.nurserostering.domain.NurseRoster</solutionClass> <planningEntityClass>org.drools.planner.examples.nurserostering.domain.ShiftAssignment</planningEntityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_AND_SOFT</scoreDefinitionType> <scoreDrl>/org/drools/planner/examples/nurserostering/solver/nurseRosteringScoreRules.drl</scoreDrl> </scoreDirectorFactory> <termination> <!-- Official benchmark maximumSecondsSpend allowed on: - ge0ffrey's main pc: sprint 11, medium 700, long 42000 --> <maximumSecondsSpend>42000</maximumSecondsSpend> </termination> <constructionHeuristic> <constructionHeuristicType>BEST_FIT</constructionHeuristicType> </constructionHeuristic> </solver> </inheritedSolverBenchmark> <solverBenchmark> <name>absolute300SeqLength2and3PillarPart</name> <solver> <localSearch> <unionMoveSelector> <moveListFactory> <cacheType>PHASE</cacheType> <moveListFactoryClass>org.drools.planner.examples.nurserostering.solver.move.factory.EmployeeChangeMoveFactory</moveListFactoryClass> </moveListFactory> <moveListFactory> <cacheType>PHASE</cacheType> <moveListFactoryClass>org.drools.planner.examples.nurserostering.solver.move.factory.ShiftAssignmentSwapMoveFactory</moveListFactoryClass> </moveListFactory> <moveListFactory> <cacheType>STEP</cacheType> <moveListFactoryClass>org.drools.planner.examples.nurserostering.solver.move.factory.ShiftAssignmentPillarPartSwapMoveFactory</moveListFactoryClass> </moveListFactory> <moveListFactory> <cacheType>STEP</cacheType> <moveListFactoryClass>org.drools.planner.examples.nurserostering.solver.move.factory.ShiftAssignmentSequenceSwitchLength2MoveFactory</moveListFactoryClass> </moveListFactory> <moveListFactory> <cacheType>STEP</cacheType> <moveListFactoryClass>org.drools.planner.examples.nurserostering.solver.move.factory.ShiftAssignmentSequenceSwitchLength3MoveFactory</moveListFactoryClass> </moveListFactory> </unionMoveSelector> <acceptor> <solutionTabuSize>1000</solutionTabuSize> <planningEntityTabuSize>11</planningEntityTabuSize> </acceptor> <forager> <minimalAcceptedSelection>1100</minimalAcceptedSelection> </forager> </localSearch> </solver> </solverBenchmark> </plannerBenchmark>