Optimal automated matching of students and universities in the ‘study abroad’ exchange programme

In this thesis, a model is created that represents the optimal matching of students and universities in the 'study abroad' exchange program. The matching has many constraints that should be considered when performing the matching. The problem is a minimisation Integer Linear Program, and by the Totally Unimodular property, can be simplified to a Linear Program. A computer implementation using the closed-source library Gurobipy is used for the automation process. The automated matching substantially outperforms the current manual matching.