rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their dissertations. Devised a multi-objective genetic algorithm for the task.
This tool helps university administrators efficiently assign final year students to dissertation supervisors. You provide student preferences, supervisor research topics, and supervisor workload limits, and it generates optimal allocation lists in minutes. It's designed for academic coordinators, department heads, or anyone managing student project assignments.
No commits in the last 6 months.
Use this if you need to quickly and fairly match hundreds of students with dozens of supervisors, balancing preferences and workloads.
Not ideal if your allocation problem involves very few students/supervisors, or if supervisor workload and preferences are not a major consideration.
Stars
23
Forks
7
Language
Python
License
MIT
Category
Last pushed
Nov 18, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/rithinch/pareto-optimal-student-supervisor-allocation"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
aimclub/SAMPO
Open-source framework for adaptive manufacturing processes scheduling
yining043/TSP-improve
An improvement-based Deep Reinforcement Learning Algorithm presented in paper...
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
Sinclert/Heuristics-TSP
Travelling Salesman Problem solution 🚚