1. Jboss Drools & Drools Planner 21 janvier 2010

4. Création en 1986

5. 35 M€ de CA en 2008 (+20 %/an en moyenne depuis 5 ans)

6. 34 % à l’International

8. Effectifs : 430 collaborateurs dans le monde, 360 en France, 300 r essources basées à Roubaix

9. Storeland pilote l’ensemble de votre supply chain étendue

10. Cylande a accompagné l’équipe de France de Judo à Pékin Le judo véhicule des valeurs CYLANDE partenaire de la FFJ

11. Lauréat du Prix PME France CHINE ACFCI / CCIFC Une croissance résolument tournée vers l’international

12. Mark's slides here

13. Q&A

14. Automated planning with Drools Planner Geoffrey De Smet Drools Planner lead "Do more with less."

16. Bin packaging

17. Employee shift rostering

20. Bin packaging

21. Employee shift rostering

24. No 2 queens can attack each other

26. N queens: an optimal solution Score = 0

30. Not the largest size

31. Not the largest side

36. Not all fireworks in the same container

37. ...

44. Forward rotation: weight 10

46. Beth dislikes Wednesday afternoon shifts

49. C is the best solution

52. Room capacity: A room's seating capacity should suffice at all times.

53. Period duration: A period's duration should suffice for all of its exams.

55. Exclusion: 2 exams should not use the same period.

58. 2 exams in a day.

59. Period spread: 2 exams that share students should be a number of periods apart.

60. Mixed durations: 2 exams that share a room should not have different durations.

61. Front load: Large exams should be scheduled earlier in the schedule.

62. Period penalty: Some periods have a penalty when used.

63. Room penalty: Some rooms have a penalty when used.

66. 7 soft constraints

68. Appointment and resource scheduling

70. Machine queue planning

71. ...

75. Blog & twitter (#droolsplanner)

77. Bin packaging

78. Employee shift rostering

80. Brute force for (periodOfExam1 : periodList) { exam1 .setPeriod(periodOfExam1); for (roomOfExam1 : roomList) { exam1 .setRoom(roomOfExam1); for (periodOfExam2 : periodList) { exam2 .setPeriod(periodOfExam2); for (roomOfExam2 : roomList) { exam2 .setRoom(roomOfExam2); ... for (periodOfExamN : periodList) { examN .setPeriod(periodOfExamN); for (roomOfExamN : roomList) { examN .setRoom(roomOfExamN); Score score = calculateScore(solution); cloneIfScoreIsBetter(solution, score); } } } }…} }

82. 80 periods

85. 80 periods

88. 80 periods

91. 80 periods

95. 2240^1096 = a little over 10^3671

108. Still too many for loops

109. Still takes forever for (periodOfExam2 : periodList) { exam2 .setPeriod(periodOfExam2); if ( exam1 .shareStudentWith( exam2 ) && periodOfExam1.equals(periodOfExam2)) { c ontinue ; // bug: best solution might break a hard constraint } ...

112. More time = better score

115. Deterministic: examination List<Exam> sortedExamList = sortExamsOnDifficulty(examList); for (exam : sortedExamList) { // Determine best remaining spot Score bestScoreOfExam = - INFINITY; for (period : periodList) { exam .setPeriod(period); for (room : roomList) { exam .setRoom(room); Score score = calculateScore(solution); if (score > bestScoreOfExam) { bestScoreOfExam = score; ... store bestPeriod, bestRoom } } } … assign exam to bestPeriod, bestRoom }

118. Great deluge

120. Ant colony optimization

121. ...

123. Give 2 queens each others rows

124. ...

126. Metaheuristic: local search

129. 2) Simple local search

130. 3) Stuck in local optimum! Source: Wikipedia

132. Drool planner configuration <selector> <selector> <moveFactoryClass>...PeriodChangeMoveFactory</...> <relativeSelection>0.002</relativeSelection> </selector> ... <selector> <moveFactoryClass>...ExamSwitchMoveFactory</...> <relativeSelection>0.002</relativeSelection> </selector> </selector> <accepter> <completeSolutionTabuSize>1000</completeSolutionTabuSize> <completeMoveTabuSize>7</completeMoveTabuSize> </accepter> <forager> <foragerType>MAX_SCORE_OF_ALL</foragerType> </forager>

134. Score attained

135. Max step count

137. Double time !=> double score Soft score Time (hours:minutes) Examination test data 7

139. Different moves

143. Bin packaging

144. Employee shift rostering

146. JAVA vs SQL vs DRL for ( q1 : queenList) { for ( q2 : queenList) { if ( q1 .getId() < q2 .getId() && q1.getY() == q2.getY() ) { ... } } } select * from Queen q1 , Queen q2 where q1 .id < q2 .id and q1.y = q2.y ; rule &quot;multipleQueensHorizontal&quot; when $q1 : Queen($id : id, $y : y ); $q2 : Queen(id > $id, y == $y );

147. N queens: score rule rule &quot;multipleQueensHorizontal&quot; when $q1 : Queen($id : id, $y : y); $q2 : Queen(id > $id, y == $y); then insertLogical( new IntConstraintOccurrence( &quot;multipleQueensHorizontal&quot; , ConstraintType.NEGATIVE_HARD, 1 , $q1 , $q2 )); end

148. Score rule isolation rule &quot;multipleQueensHorizontal&quot; when $q1 : Queen($id : id, $y : y); $q2 : Queen(id > $id, y == $y ); then ... end rule &quot;multipleQueensAscendingDiagonal&quot; when $q1 : Queen($id : id, $ascendingD : ascendingD); $q2 : Queen(id > $id, ascendingD == $ascendingD ); then ... end rule &quot;multipleQueensDescendingDiagonal&quot; when $q1 : Queen($id : id, $descendingD : descendingD); $q2 : Queen(id > $id, descendingD == $descendingD ); then ... end

152. Adding constraints is easy and scalable

153. Switching/combining algorithms is easy

158. Pas d'Utilisation Commerciale

161. Merci à Cylande pour son sponsoring