Graduation Projects Distribution with Genetic Algorithm

Goal

This programming project can be viewed as an application of searching search algorithm in real-world problems.

Specifications

Developing a Graduation projects distribution is not an easy task. It has many variables: Students, Supervisors, Topics and selection order. The aim of this project is to distribute the topics based on the student’s selection as much as possible. One of the common approaches to solve this problem is using CSP or Genetic algorithms.

Therefore, the aim of this project is to use Genetic algorithm to optimize the distribution of the graduation projects topics based on the student’s selection order. The input for this project is as follows:

• File (Student’s selection) contains the student’s selection. The file contains the students’ names, and selection order where the first choice is the most preferable. The number indicates the project number (see the second file).
• File ( Project Ideas ) contains projects topics, where the first column indicates project number used in the first file.

The generated optimized solutions must consider the following:

• Each student must be assigned a topic.
• The topic can be assigned to one group only.
• The assignment must be closer as much as possible to the order of selection.