The COVID19 crisis has posed many problems in 2020. One of these problems is some of my first year Master's mentees not being able to go back to their countries during the Holidays. As TU Delft students we have had to go though a lot in these 2 quarters. Lets find the optimal way to organise these dinners.
- Only upto 3 guests are allowed at a time.
- Guests should be able to maintain 1.5m distance.
- Name
- Preferrences for dates with rankings
- If they can cook
- For what course would they be willing to cook/bring food along.
- dietary restrictions.
- drinks preference
- All mentees should be able to attend and not resampled on the same day (no clones available).
- Should get their preferred date according to ranking.
- Should be willing to cook/bring along for different courses
Not considered:
- dietary restrictions, because there weren't a lot.
- drinks preference, because it was easy to acomodate.
- ability to cook, because many cooks were available.
We will contruct and solve this Many Objective Optimization (MOO) problem using an evolutionary algorithm called NSGA-II.
We will use the pymoo library to make the evolutionary strategy simpler.
- make a virtual environment using
python -m venv ./christmas_dinner-venv
- select the environment using
source ./christmas_dinner-venv/bin/activate
- install the dependencies
pip install -r requirements.txt
- run thee notebook
./christmas-dinner.ipynb
using an IDE or jupyter server.