Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation

The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and...

Full description

Saved in:
Bibliographic Details
Published in:Algorithms 2021-08, Vol.14 (8), p.219
Main Authors: Thiruvady, Dhananjay, Morgan, Kerri, Bedingfield, Susan, Nazari, Asef
Format: Article
Language:English
Subjects:
Algorithms
allocation
Allocations
ant colony optimisation
Ant colony optimization
Colleges & universities
Employees
Heuristic
industry placements
Integer programming
Learning
Learning programs
Linear programming
matching
Preferences
Students
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more engaged when they are allocated students that meet their industry requirements. In this paper, both an integer programming model and an ant colony optimisation heuristic are proposed, with the aim of automating the allocation of students to industry placements. The emphasis is on maximising student engagement and industry partner satisfaction. As part of the objectives, these methods incorporate diversity in industry sectors for students undertaking multiple placements, gender equity across placement providers, and the provision for partners to rank student selections. The experimental analysis is in two parts: (a) we investigate how the integer programming model performs against manual allocations and (b) the scalability of the IP model is examined. The results show that the IP model easily outperforms the previous manual allocations. Additionally, an artificial dataset is generated which has similar properties to the original data but also includes greater numbers of students and placements to test the scalability of the algorithms. The results show that integer programming is the best option for problem instances consisting of less than 3000 students. When the problem becomes larger, significantly increasing the time required for an IP solution, ant colony optimisation provides a useful alternative as it is always able to find good feasible solutions within short time-frames.
ISSN:1999-4893
1999-4893
DOI:10.3390/a14080219