Geek asks and answers

Genetic Schedule Algorithm

I am writing an application for automatic scheduling of a university and use a genetic algorithm for this. But now I have run into some implementation issues.

At the very beginning, I suggested that we have classes with a duration of 1 time interval (time interval = 1 hour), and we can just put it in an array (represents the schedule grid: 1st array with capacity numberOfRooms * numberOfDays * numberOfTimeslots) and can also perform mutation and crossover without problems.

But I know that I want to improve the application and let me have classes with a duration of several time intervals. There are many problems here:

How can we put one object of a class into an array and fill all the slots (several cells of the array), which class should occupy (one object - several cells)? And according to how we put it in an array, how can we perform the mutation and crossover operation? Thanks in advance! I really appreciate your help!

+3
source share
1 answer

A good rule can only intersect classes that have the same time intervals. For example, you can cross a class that spans two time slots with two classes that span one time span.

, , , - , , , , , , , .

() : DailyRoomOccupation. :

  • , ;
  • a ( ) , ;
  • , , ;
  • , DailyRoomOccupation s, .
+3

More articles:


All Articles