Geek Answers Handbook

Solving Planning Issues

I am new to the AI ​​/ algorithm field and currently trying to solve the problem, so far I just implemented A * path detection in a 2d grid array.

The problem is as follows:

Consider a class of 40 students (20f, 20 m) with different heights and having their own preferences for sitting (row, column or both) and a class of 50 places, each student should take a place and the places are as follows:

[ ] [ ] [ ]   [ ] [ ] [ ] [ ]   [ ] [ ] [ ]
[ ] [ ] [ ]   [ ] [ ] [ ] [ ]   [ ] [ ] [ ]
[ ] [ ] [ ]   [ ] [ ] [ ] [ ]   [ ] [ ] [ ]
[ ] [ ] [ ]   [ ] [ ] [ ] [ ]   [ ] [ ] [ ]
[ ] [ ] [ ]   [ ] [ ] [ ] [ ]   [ ] [ ] [ ]

              [ WHITE BOARD ]

In order to ideally sit behind them, a rating graph was chosen:

  • No students sitting in front of themselves: +4 points.
  • Student seats in front of you are shorter than at least 2 cm: +4 points.
  • The student seats next to you have the opposite sex: +8 points.
  • 4 students of the same gender, occupying the column: -10 points.
  • Column with increasing height from the board: +20 points
  • : +2 .

, .

- A *, :

:

:

:

, , , , ( +8, +4, - +2, +20), , , , 5. : ? .

1. ? ( /go )

2.Am ?

+4
1

6 , NP- NP-. : A * () , ( P = NP) . , , . 6, , Tabu Search, Simulated Annealing Late Acceptance, , .

6 , - , First Fit Decreasing, :

  • , ( 1 , ). . 1 .
  • 1 . .
  • (, -, ).

2 , ... - Tabu Late Acceptance.

+2

More articles:


All Articles