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

Victor Sanchez-Anguix*, Rithin Chalumuri, Reyhan Aydoğan, Vicente Julian

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

15 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1-15
Number of pages15
JournalApplied Soft Computing Journal
Volume76
DOIs
Publication statusPublished - 2019

Keywords

  • Artificial intelligence
  • Genetic algorithms
  • Matching
  • Pareto optimal
  • student–project allocation

Fingerprint

Dive into the research topics of 'A near Pareto optimal approach to student–supervisor allocation with two sided preferences and workload balance'. Together they form a unique fingerprint.

Cite this