Population Based Techniques for Solving the Student Project Allocation Problem

Population Based Techniques for Solving the Student Project Allocation Problem

Patrick Kenekayoro (Mathematics / Computer Science Department, Niger Delta University, Amassoma, Nigeria), Promise Mebine (Niger Delta University, Amassoma, Nigeria) and Bodouowei Godswill Zipamone (Niger Delta University, Amassoma, Nigeria)
Copyright: © 2020 |Pages: 16
DOI: 10.4018/IJAMC.2020040110
OnDemand PDF Download:
No Current Special Offers


The student project allocation problem is a well-known constraint satisfaction problem that involves assigning students to projects or supervisors based on a number of criteria. This study investigates the use of population-based strategies inspired from physical phenomena (gravitational search algorithm), evolutionary strategies (genetic algorithm), and swarm intelligence (ant colony optimization) to solve the Student Project Allocation problem for a case study from a real university. A population of solutions to the Student Project Allocation problem is represented as lists of integers, and the individuals in the population share information through population-based heuristics to find more optimal solutions. All three techniques produced satisfactory results and the adapted gravitational search algorithm for discrete variables will be useful for other constraint satisfaction problems. However, the ant colony optimization algorithm outperformed the genetic and gravitational search algorithms for finding optimal solutions to the student project allocation problem in this study.
Article Preview

Student Project Allocation Problem

The dataset for the SPA problem from the case study department contained:

Complete Article List

Search this Journal:
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing