| Name | ID Number |
|---|---|
| Siddharth Chaitra Vivek | 2022A7PS0569G |
| Amogh Balepur | 2022A7PS1228G |
| Chaitanya Joshi | 2022A7PS0730G |
This project attempts to find a solution for optimization of university course assignments within a department, where faculty members can handle multiple course loads and have their own preference order. The primary objective revolves around fulfilling course allocations while adhering to individual preferences and category-based constraints. The problem is solved employing a penalty-based assignment strategy and utilizing the Hungarian algorithm for weighted graphs. The findings underscore the suitability and effectiveness of this tailored approach in solving the complex course assignment optimization problem. The paper presents a few test cases and a set of close to optimal solutions generated by the code implementation
Overview Paper: Optimizing University Course Assignment.pdfhttps://github.com/S1ddh4rth/Disco-Project/blob/main/Optimizing%20University%20Course%20Assignment.pdf
Results and Crash test consistency report: Results and Crash test consistency report.pdfhttps://github.com/S1ddh4rth/Disco-Project/blob/main/Results%20and%20Crash%20test%20consistency%20report.pdf
https://drive.google.com/drive/folders/1Cx6LEVxYOOtQqfoKJQdgPvlHT14UWC2N?usp=sharing