Metaheuristic Algorithms for Handling Time Interval Coverage Constraints in Nurse Scheduling
Budget: $10 – $20 USD
Nurse rostering. This is a practical problem asking to find a schedule of nurses in a hospital. It is in fact a constraint satisfaction problem that can be solved by using different meta-heuristics (evolutionary algorithms (EA), estimation of distribution algorithms (EDA), ant colony optimization (ACO), variable neighborhood search (VNS), tabu search (TS), hyper-heuristics, etc).
Requirement:
Select a problem variant, identify, and describe an adequate method (based on EA, EDA, ACO, VNS, or TS), implement and test it.
Variants: 5 (EA, EDA, ACO, VNS, TS)
- Python code
- Explanation of each step
- Visualisation / plots . etc.
- Meeting to explain what you did
Attached 2 examples which I need the same.
Requirement:
Select a problem variant, identify, and describe an adequate method (based on EA, EDA, ACO, VNS, or TS), implement and test it.
Variants: 5 (EA, EDA, ACO, VNS, TS)
- Python code
- Explanation of each step
- Visualisation / plots . etc.
- Meeting to explain what you did
Attached 2 examples which I need the same.