Finding the Optimal Job Assignment for a Home-Help Service

Evdokia Mina


Supervised by Richard Booth; Moderated by Luis Espinosa-Anke

This project is about developing and implementing an algorithm to solve a particular real-world problem. You are the boss of a company that organises home-help visits for elderly patients. Your staff is made up of a fixed number of support workers who must visit a fixed number of homes, spending a set amount of time at each home. Each patient has preferences about the number and timings (e.g., "not before 10am", "between 1pm and 2pm") of the visits they receive each day. You must assign staff to visits in such a way that the total distance travelled is minimal, while adhering as much as possible to the preferences of the patients. In addition the job assignment should be fair (i.e., each member of staff should have an approximately equal workload).

Initial Plan (04/02/2019) [Zip Archive]

Final Report (10/05/2019) [Zip Archive]

Publication Form