抄録
The time tabling problem is an important combinatorial optimization problem that arises in schools and so on. In this paper, we treat the problem of time tabling by incorporating the requests. This kind of problem occurs when the problem is commercially-based so that the applicants' requests must be highly satisfied, or many of the applicants are so busy that they can be assigned only to the time slots which they request. For such problems, we propose an approach using the genetic algorithm (GA). We formulate this problem as the permutation problem of the order of assignment of the requests, where the permutation is defined as the chromosome of the GA code. We circumvent the hard constraints by using the allocation module, and try to pursue the local optimality by using the minor tuning module.
