A near Pareto optimal approach to student-supervisor allocation with two sided preferences and workload balance

12/16/2018
by   Victor Sanchez-Anguix, et al.
0

The problem of allocating students to supervisors for the development of a personal project or a dissertation is a crucial activity in the higher education environment, as it enables students to get feedback on their work from an expert and improve their personal, academic, and professional abilities. In this article, we propose a multi-objective and near Pareto optimal genetic algorithm for the allocation of students to supervisors. The allocation takes into consideration the students and supervisors' preferences on research/project topics, the lower and upper supervision quotas of supervisors, as well as the workload balance amongst supervisors. We introduce novel mutation and crossover operators for the student-supervisor allocation problem. The experiments carried out show that the components of the genetic algorithm are more apt for the problem than classic components, and that the genetic algorithm is capable of producing allocations that are near Pareto optimal in a reasonable time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2019

Pareto optimal coalitions of fixed size

We tackle the problem of partitioning players into groups of fixed size,...
research
05/24/2018

Super-stability in the Student-Project Allocation Problem with Ties

The Student-Project Allocation problem with lecturer preferences over St...
research
10/22/2018

A simulated annealing approach to the student-project allocation problem

We describe a solution to the student-project allocation problem using s...
research
04/22/2021

Constructing a personalized learning path using genetic algorithms approach

A substantial disadvantage of traditional learning is that all students ...
research
04/26/2018

An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects

The Student-Project Allocation problem with preferences over Projects (S...
research
09/19/2019

Learning Optimal and Near-Optimal Lexicographic Preference Lists

We consider learning problems of an intuitive and concise preference mod...

Please sign up or login with your details

Forgot password? Click here to reset