drools 플래너를위한 좋은“hello world”프로그램

Question

시간표를 할당하기 위해 Drools Planner를 구현하려고합니다.현재 Java 및 JavaBean 디자인 패턴에 대한 저의 숙련도가 낮고 실습하기 쉬운 무언가가 필요합니다.

AI 최적화 문제 가 있습니까

1. 'X'알고리즘으로 잘 해결되는 것으로 알려져 있습니다.
2. 데이터 모델은 간단한 방식으로 JavaBean 디자인 패턴으로 표현 될 수 있습니다.
3. 최소한의 추가 기능 사용 (예 : 계획 엔터티 난이도)

   이러한 문제는 Drools Planner에서 이빨을 자르면 좋을 것입니다. <시간>

   나는 지금 가장 단순한 N-Queens 문제를 시도하고 있습니다.그래서이 리그에서 뭔가를 찾고 있습니다.

Answer 1

I am trying 2X2 Sudoku (generating and solving) as something simple. You can model it on Nqueens code. While 2x2 sudokus are solved easily, 3x3 sudokus may get stuck. So you can implement swap moves.

Another interesting problem would be bucket sums. Given 10 buckets, each able to contain 5 numbers each, and 50 numbers; make a program to allocate the numbers so that the sum of numbers in each bucket are more or less even.

Bucket Bucket0 3 6 19 16 11  =55
Bucket Bucket1 8 2 5 25 15  =55
...
Bucket Bucket7 3 25 4 16 8  =56
Bucket Bucket8 12 20 12 9 2  =55
Bucket Bucket9 4 9 11 12 20  =56

This has practical implications, such as evenly distributing tasks of varying toughness throughout the week.

---

A collection of some problems: http://eclipseclp.org/examples/index.html

Answer 2

Update: See CloudBalancingHelloWorld.java in optaplanner-examples (Drools Planner is renamed to OptaPlanner).

You could also try implementing the ITC2007 curriculum course scheduling yourself and then compare it with the source code of the example in Drools Planner. If you want to keep it simple but get decent results too, follow this recipe and go for First Fit followed by Tabu Search.

Another good idea, is to join the ITC2011 scheduling competition: it's still open till 1-MAY-2012 and very similar to the curriculum course scheduling example.