Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming
Abstract
:1. Introduction
- (1)
- A progressively optimized hybrid genetic algorithm tool (POGA-DP) was developed and tested on 520 course scheduling tasks at Beijing Forestry University to improve the resource utilization and meet the practical scheduling needs. The innovation of this algorithm lies in its combination of the advantages of the GA and DP, enhancing the computational efficiency while avoiding local optima.
- (2)
- We not only verified the effectiveness and stability of POGA-DP in complex instances but also conducted a comprehensive performance comparison with a GA, the Producer-Scavenger Method (PSM) [32], and the Particle Ant Colony Algorithm (ACO). The results demonstrated the significant advantages of POGA-DP in terms of the resource utilization and scheduling quality.
- (3)
- This paper designed multiple fitness functions to optimize different objectives (such as th eresource utilization and the number of classrooms used), further enhancing the practicality and stability of the algorithm.
- (4)
- To ensure the continuity of the scheduling scheme, we also analyzed the similarity of the course arrangements between adjacent weeks, verifying the stability and applicability of POGA-DP in long-term scheduling.
2. Model Building
2.1. Description of the Problem
- (1)
- In the same time slot, a teacher can teach only one course;
- (2)
- In the same time slot, a classroom can accommodate only one course;
- (3)
- In the same time slot, a class can be scheduled for only one course;
- (4)
- The scheduling process must meet the time requirements for each course;
- (5)
- The classroom assigned to a course must be able to accommodate all students, especially in the case of combined classes;
- (6)
- When a course is a combined class, multiple administrative classes need to attend the same course at the same time and in the same classroom;
- (7)
- Special courses require assignment to specific classrooms, such as laboratories for experiments, music rooms, and chemistry labs;
- (8)
- When the time slot of a teaching event is fixed, the time slot for that teaching class cannot be changed;
- (9)
- The course hours need to be completed within the specified weeks.
- (1)
- Distribute the same course evenly throughout the week;
- (2)
- Distribute the courses for each administrative class evenly throughout the week to avoid scheduling too many courses on the same day, which could lead to an excessive burden on students;
- (3)
- Avoid having too many teaching hours for instructors within a single day to prevent excessive concentration;
- (4)
- Strive to accommodate the preferred teaching times of the instructors;
- (5)
- Aim to optimize the utilization of classrooms and equipment to avoid resource wastage.
2.2. Decision Variables and Sets
2.3. The Fitness Function
2.4. Hard Constraints
- Constraint Equation (3) ensures that a teacher can only teach one course at a time.
- Constraint Equation (4) ensures that a classroom can only accommodate one course at a time.
- Constraint Equation (5) ensures that a class can only be scheduled for one course at a time.
- Constraint Equation (6) ensures that the required number of teaching hours for each course is met.
- Constraint Equation (7) ensures that the number of students in a class does not exceed the capacity of the classroom.
- Constraint Equation (8) ensures that the relevant administrative classes for combined courses are scheduled at the same time and in the same location.
- Constraint Equation (9) ensures that special courses are scheduled in specialized classrooms.
- Constraint Equation (10) ensures that if the time slot for a teaching event is fixed, the time slot for the teaching class remains unchanged.
- Constraint Equation (11) ensures that the required number of class hours for each course is met.
2.5. Soft Constraints
- Constraint Equation (12) specifies that a course should be distributed as evenly as possible throughout the week.
- Constraints Equations (13) and (14) specify that the courses for each administrative class should be distributed as evenly as possible.
- Constraints Equations (15) and (16) specify that a teacher’s teaching times should be distributed as evenly as possible.
- Constraint Equation (17) specifies that the teaching time preferences of teachers should be met as closely as possible.
- Constraint Equation (18) specifies that the utilization of classrooms and equipment should be maximized as much as possible.
3. Optimizing the UCSP Using POGA-DP
3.1. The Solution Method
3.2. Time Slot Scheduling Based on Genetic Algorithms
3.2.1. Chromosome Encoding
3.2.2. The Swap Operation with the Judgment Mechanism
3.2.3. The Forced Mutation Operation with the Repair Mechanism
3.3. Classroom Scheduling Based on Dynamic Programming
4. Numerical Experiments
4.1. Experimental Examples and Settings
4.2. Experimental Results
4.3. The Impact of the Course Arrangement Similarity Between Adjacent Weeks
5. Discussion
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Khamechian, M.; Petering, M.E. A mathematical modeling approach to university course planning. Comput. Ind. Eng. 2022, 168, 107855. [Google Scholar] [CrossRef]
- Hartmanis, J. Computers and intractability: A guide to the theory of np-completeness (michael r. garey and david s. johnson). Siam Rev. 1982, 24, 90. [Google Scholar] [CrossRef]
- Wang, Y.Z. Using genetic algorithm methods to solve course scheduling problems. Expert Syst. Appl. 2003, 25, 39–50. [Google Scholar] [CrossRef]
- Morais, R.; Bulhões, T.; Subramanian, A. Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates. Eur. J. Oper. Res. 2024, 315, 442–453. [Google Scholar] [CrossRef]
- Liu, J.; Zhang, Z.; Liu, S.; Zhang, Y.; Wu, T. Parallel hyper heuristic algorithm based on reinforcement learning for the corridor allocation problem and parallel row ordering problem. Adv. Eng. Inform. 2023, 56, 101977. [Google Scholar] [CrossRef]
- Tomczak, M.; Jaśkowski, P. Customized particle swarm optimization for harmonizing multi-section construction projects. Autom. Constr. 2024, 162, 105359. [Google Scholar] [CrossRef]
- Fontes, D.B.; Homayouni, S.M.; Gonçalves, J.F. A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Eur. J. Oper. Res. 2023, 306, 1140–1157. [Google Scholar] [CrossRef]
- Wu, H.; Pang, G.K.H.; Choy, K.L.; Lam, H.Y. Dynamic resource allocation for parking lot electric vehicle recharging using heuristic fuzzy particle swarm optimization algorithm. Appl. Soft Comput. 2018, 71, 538–552. [Google Scholar] [CrossRef]
- Muñoz-Díaz, M.L.; Escudero-Santana, A.; Lorenzo-Espejo, A. Solving an Unrelated Parallel Machines Scheduling Problem with machine-and job-dependent setups and precedence constraints considering Support Machines. Comput. Oper. Res. 2024, 163, 106511. [Google Scholar] [CrossRef]
- Bellio, R.; Ceschia, S.; Di Gaspero, L.; Schaerf, A.; Urli, T. Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput. Oper. Res. 2016, 65, 83–92. [Google Scholar] [CrossRef]
- Tamssaouet, K.; Dauzère-Pérès, S.; Knopp, S.; Bitar, A.; Yugma, C. Multiobjective optimization for complex flexible job-shop scheduling problems. Eur. J. Oper. Res. 2022, 296, 87–100. [Google Scholar] [CrossRef]
- De Moraes, M.B.; Coelho, G.P. A diversity preservation method for expensive multi-objective combinatorial optimization problems using Novel-First Tabu Search and MOEA/D. Expert Syst. Appl. 2022, 202, 117251. [Google Scholar] [CrossRef]
- Tosun, U. A new tool for automated transformation of quadratic assignment problem instances to quadratic unconstrained binary optimisation models. Expert Syst. Appl. 2022, 201, 116953. [Google Scholar] [CrossRef]
- Lü, Z.; Hao, J.K. Adaptive tabu search for course timetabling. Eur. J. Oper. Res. 2010, 200, 235–244. [Google Scholar] [CrossRef]
- Ji, B.; Zhang, Z.; Samson, S.Y.; Zhou, S.; Wu, G. Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints. Eur. J. Oper. Res. 2023, 306, 1219–1235. [Google Scholar] [CrossRef]
- Hossain, S.I.; Akhand, M.; Shuvo, M.; Siddique, N.; Adeli, H. Optimization of university course scheduling problem using particle swarm optimization with selective search. Expert Syst. Appl. 2019, 127, 9–24. [Google Scholar] [CrossRef]
- Shiau, D.F. A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences. Expert Syst. Appl. 2011, 38, 235–248. [Google Scholar] [CrossRef]
- Ayob, M.; Jaradat, G. Hybrid ant colony systems for course timetabling problems. In Proceedings of the 2009 2nd Conference on Data Mining and Optimization, Selangor, Malaysia, 27–28 October 2009; IEEE: Piscataway, NJ, USA, 2009; pp. 120–126. [Google Scholar]
- Hiryanto, L. Incorporating dynamic constraint matching into vertex-based graph coloring approach for university course timetabling problem. In Proceedings of the 2013 International Conference on QiR, Yogyakarta, Indonesia, 25–28 June 2013; IEEE: Piscataway, NJ, USA, 2013; pp. 68–72. [Google Scholar]
- Wen, X.; Zhang, X.; Xing, H.; Ye, G.; Li, H.; Zhang, Y.; Wang, H. An improved genetic algorithm based on reinforcement learning for aircraft assembly scheduling problem. Comput. Ind. Eng. 2024, 193, 110263. [Google Scholar] [CrossRef]
- Squires, M.; Tao, X.; Elangovan, S.; Gururajan, R.; Zhou, X.; Acharya, U.R. A novel genetic algorithm based system for the scheduling of medical treatments. Expert Syst. Appl. 2022, 195, 116464. [Google Scholar] [CrossRef]
- Xiang, K.; Hu, X.; Yu, M.; Wang, X. Exact and heuristic methods for a university course scheduling problem. Expert Syst. Appl. 2024, 248, 123383. [Google Scholar] [CrossRef]
- Domenech, B.; Lusa, A. A MILP model for the teacher assignment problem considering teachers’ preferences. Eur. J. Oper. Res. 2016, 249, 1153–1160. [Google Scholar] [CrossRef]
- Esmaeilbeigi, R.; Mak-Hau, V.; Yearwood, J.; Nguyen, V. The multiphase course timetabling problem. Eur. J. Oper. Res. 2022, 300, 1098–1119. [Google Scholar] [CrossRef]
- Ziadlou, G.; Emami, S.; Asadi-Gangraj, E. Network configuration distributed production scheduling problem: A constraint programming approach. Comput. Ind. Eng. 2024, 188, 109916. [Google Scholar] [CrossRef]
- Meng, L.; Zhang, C.; Ren, Y.; Zhang, B.; Lv, C. Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 2020, 142, 106347. [Google Scholar] [CrossRef]
- Qin, T.; Du, Y.; Chen, J.H.; Sha, M. Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel. Eur. J. Oper. Res. 2020, 285, 884–901. [Google Scholar] [CrossRef]
- Dvořák, P.; Eiben, E.; Ganian, R.; Knop, D.; Ordyniak, S. The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 2021, 300, 103561. [Google Scholar] [CrossRef]
- Klein, N.; Gnägi, M.; Trautmann, N. Mixed-integer linear programming for project scheduling under various resource constraints. Eur. J. Oper. Res. 2024, 319, 79–88. [Google Scholar] [CrossRef]
- Caselli, G.; Delorme, M.; Iori, M. Integer linear programming for the tutor allocation problem: A practical case in a British university. Expert Syst. Appl. 2022, 187, 115967. [Google Scholar] [CrossRef]
- Mallari, C.B.; San Juan, J.L.; Li, R. The university coursework timetabling problem: An optimization approach to synchronizing course calendars. Comput. Ind. Eng. 2023, 184, 109561. [Google Scholar] [CrossRef]
- Akhand, M.A.H.; Hossain, F. Producer-Scrounger Method to Solve Traveling Salesman Problem. Int. J. Intell. Syst. Appl. 2015, 7, 29–36. [Google Scholar] [CrossRef]
- Daskalaki, S.; Birbas, T.; Housos, E. An integer programming formulation for a case study in university timetabling. Eur. J. Oper. Res. 2004, 153, 117–135. [Google Scholar] [CrossRef]
- Thepphakorn, T.; Pongcharoen, P. Performance improvement strategies on Cuckoo Search algorithms for solving the university course timetabling problem. Expert Syst. Appl. 2020, 161, 113732. [Google Scholar] [CrossRef]
- Akkan, C.; Gülcü, A. A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. Comput. Oper. Res. 2018, 90, 22–32. [Google Scholar] [CrossRef]
- Thompson, G.M. Using information on unconstrained student demand to improve university course schedules. J. Oper. Manag. 2005, 23, 197–208. [Google Scholar] [CrossRef]
- Zhang, H.; Liu, F.; Zhou, Y.; Zhang, Z. A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem. Inf. Sci. 2020, 539, 347–374. [Google Scholar] [CrossRef]
- Qiao, Y.; Wu, N.; He, Y.; Li, Z.; Chen, T. Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement. Expert Syst. Appl. 2022, 208, 118068. [Google Scholar] [CrossRef]
- Bacalhau, E.T.; Casacio, L.; de Azevedo, A.T. New hybrid genetic algorithms to solve dynamic berth allocation problem. Expert Syst. Appl. 2021, 167, 114198. [Google Scholar] [CrossRef]
- Li, A.D.; Xue, B.; Zhang, M. Multi-objective feature selection using hybridization of a genetic algorithm and direct multisearch for key quality characteristic selection. Inf. Sci. 2020, 523, 245–265. [Google Scholar] [CrossRef]
- Kadri, R.L.; Boctor, F.F. An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case. Eur. J. Oper. Res. 2018, 265, 454–462. [Google Scholar] [CrossRef]
- Ferreira, F.A.B.S.; LeitãO, H.A.S.; Lopes, W.T.A.; Madeiro, F. Hybrid firefly-linde-buzo-gray algorithm for Channel-Optimized Vector Quantization codebook design. Integr. Comput. Aided Eng. 2017, 24, 1–18. [Google Scholar] [CrossRef]
- Iglesias, A.; Gálvez, A.; Collantes, M. Multilayer embedded bat algorithm for B-spline curve reconstruction. Integr. Comput.-Aided Eng. 2017, 24, 385–399. [Google Scholar] [CrossRef]
Sets: | |
---|---|
C | Set of courses; |
T | Set of teachers; |
R | Set of classrooms; |
A | Set of course types; |
D | Set of days in a week, with a weekly schedule consisting of 5 days; |
W | Set of weeks; |
E | Set of administrative classes; |
P | Set of teaching classes; |
M | Set of teaching events; |
K | Set of time slots in a week, with 5 days in a week and 5 time slots in a day; |
Weekly contact hours of course c, ; | |
Set of courses that the teacher t needs to teach; . | |
Set of courses scheduled in classroom r, ; | |
Set of courses of type a, ; | |
Set of courses for administrative class e, ; | |
Set of courses specified by teaching event m, ; | |
Set of classrooms of course c, ; | |
Set of classrooms of type a, ; | |
Set of weeks specified by teaching event m, ; | |
Set of administrative classes belonging to teaching class p, ; | |
Set of teaching events with fixed time slots; | |
Set of time slots specified by teaching event m, . | |
Parameters: | |
The maximum capacity of classroom r, ; | |
The number of administrative classes belonging to teaching class p, ; | |
The number of students in classroom r during time slot k in week w, , , ; | |
The number of class hours scheduled for administrative class e on day d, , ; | |
The number of teaching hours scheduled for teacher t on day d, , ; | |
Decision Variables: | |
1 if course c is scheduled in week w during time slot k; 0 otherwise. | |
1 if administrative class e uses classroom r during time slot k in week w; 0 otherwise. | |
1 if a course is scheduled in time slot k of classroom r during the set of weeks w; 0 otherwise. | |
1 if course c is scheduled on day d of week w; 0 otherwise. | |
The type of course c, . | |
The type of classroom r, . | |
The quality of the teaching schedule for teacher t, . | |
The number of consecutive teaching sessions for teacher t, . | |
1 if ; 0 otherwise. |
Timeslot | Mon | Tue | Wed | Thu | Fri |
---|---|---|---|---|---|
1 | 1 | 3 | 2 | −2 | 6 |
2 | 2 | 4 | 3 | −2 | 6 |
3 | 4 | 6 | −2 | 4 | 5 |
4 | 3 | 3 | −2 | 4 | −2 |
5 | 0 | 0 | −2 | 3 | −2 |
Instance | Combined Courses | Independent Courses | Teachers | Total Courses |
---|---|---|---|---|
Instance 1 | 0 | 6 | 5 | 6 |
Instance 2 | 0 | 16 | 8 | 16 |
Instance 3 | 0 | 26 | 13 | 26 |
Instance 4 | 0 | 33 | 19 | 33 |
Instance 5 | 0 | 57 | 38 | 57 |
Instance 6 | 18 | 0 | 7 | 18 |
Instance 7 | 42 | 0 | 16 | 42 |
Instance 8 | 177 | 0 | 55 | 177 |
Instance 9 | 302 | 0 | 92 | 302 |
Instance 10 | 463 | 0 | 148 | 463 |
Instance 11 | 5 | 6 | 8 | 11 |
Instance 12 | 10 | 6 | 10 | 16 |
Instance 13 | 42 | 16 | 24 | 58 |
Instance 14 | 177 | 57 | 92 | 234 |
Instance 15 | 463 | 57 | 176 | 520 |
Instance | Average Fitness | Best Fitness | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
GA | PSO | PSM | POGA-DP | ACO | GA | PSO | PSM | POGA-DP | ACO | |
Instance 1 | 41.0 | 33.7 | 38.5 | 41.0 | 39.8 | 41 | 35 | 41 | 41 | 40 |
Instance 2 | 73.4 | 60.5 | 76.4 | 106.7 | 75.2 | 82 | 66 | 79 | 108 | 78 |
Instance 3 | 131.1 | 109.0 | 130.2 | 206.8 | 128.5 | 144 | 115 | 138 | 212 | 136 |
Instance 4 | 139.8 | 114.7 | 140.7 | 245.2 | 138.1 | 153 | 126 | 146 | 263 | 145 |
Instance 5 | 233.6 | 178.9 | 242.8 | 449.6 | 238.4 | 262 | 194 | 254 | 459 | 250 |
Instance 6 | 56.8 | 55.3 | 57.2 | 72.0 | 56.5 | 57 | 59 | 61 | 73 | 60 |
Instance 7 | 100.0 | 97.2 | 105.9 | 143.3 | 103.8 | 102 | 98 | 108 | 146 | 105 |
Instance 8 | 338.3 | 278.4 | 331.6 | 544.5 | 330.2 | 360 | 297 | 348 | 551 | 342 |
Instance 9 | 602.5 | 506.6 | 572.1 | 924.0 | 580.3 | 631 | 524 | 599 | 932 | 590 |
Instance 10 | 929.6 | 732.5 | 897.0 | 1437.2 | 910.7 | 977 | 722 | 922 | 1448 | 915 |
Instance 11 | 40.0 | 34.4 | 49.8 | 77.0 | 46.2 | 40 | 36 | 52 | 77 | 48 |
Instance 12 | 63.3 | 58.9 | 64.6 | 100.9 | 62.5 | 66 | 61 | 67 | 101 | 65 |
Instance 13 | 175.9 | 133.6 | 175.3 | 244.0 | 172.8 | 184 | 140 | 177 | 248 | 174 |
Instance 14 | 551.3 | 452.8 | 561.4 | 905.1 | 550.6 | 583 | 472 | 578 | 912 | 570 |
Instance 15 | 1133 | 941.3 | 1077.1 | 1719.8 | 1075.4 | 1183 | 970 | 1104 | 1739 | 1098 |
Instance | Occupancy | Occupancy Std. Dev. | Classroom Usage | |||
---|---|---|---|---|---|---|
GA | POGA-DP | GA | POGA-DP | GA | POGA-DP | |
Instance 1 | 66.000% | 66.000% | 0.000% | 0.000% | 3 | 3 |
Instance 2 | 49.611% | 48.542% | 0.371% | 0.329% | 6 | 5 |
Instance 3 | 37.422% | 38.374% | 0.642% | 0.770% | 12 | 10 |
Instance 4 | 34.790% | 36.586% | 0.628% | 1.604% | 13 | 13 |
Instance 5 | 27.461% | 35.268% | 1.184% | 0.886% | 25 | 17 |
Instance 6 | 45.720% | 47.382% | 0.255% | 0.270% | 9 | 6 |
Instance 7 | 51.909% | 51.871% | 0.176% | 0.276% | 14 | 11 |
Instance 8 | 45.739% | 40.733% | 0.590% | 0.629% | 34 | 23 |
Instance 9 | 43.357% | 45.067% | 0.870% | 0.608% | 58 | 37 |
Instance 10 | 46.111% | 42.073% | 1.290% | 0.952% | 72 | 49 |
Instance 11 | 51.435% | 55.250% | 0.157% | 0.000% | 6 | 6 |
Instance 12 | 50.357% | 51.972% | 0.247% | 0.095% | 8 | 8 |
Instance 13 | 45.708% | 50.612% | 0.406% | 0.368% | 20 | 15 |
Instance 14 | 40.199% | 39.042% | 1.045% | 0.641% | 48 | 38 |
Instance 15 | 42.111% | 43.995% | 1.525% | 0.885% | 82 | 58 |
Week | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | 0 | 0 | 8 | 0 | 0 | 0 | 0 | 8 | 0 | 0 | 0 | 4 | 0 | 5 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 5 | 7 | 0 | 7 |
2 | 0 | 5 | 8 | 4 | 2 | 7 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 8 | 5 | 7 | 0 |
3 | 0 | 0 | 5 | 0 | 8 | 4 | 2 | 0 | 9 | 7 | 3 | 0 | 2 | 0 | 9 | 0 | 0 | 0 | 0 | 3 | 0 | 5 | 8 | 5 | 7 |
4 | 5 | 3 | 8 | 4 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 0 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
5 | 5 | 3 | 8 | 0 | 9 | 0 | 2 | 3 | 7 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 5 | 7 | 5 | 9 | 0 |
6 | 3 | 5 | 0 | 0 | 0 | 0 | 2 | 0 | 7 | 8 | 2 | 0 | 0 | 3 | 0 | 0 | 0 | 8 | 0 | 5 | 0 | 0 | 0 | 5 | 7 |
7 | 0 | 0 | 0 | 5 | 9 | 0 | 2 | 7 | 3 | 8 | 2 | 6 | 9 | 0 | 0 | 0 | 3 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
8 | 0 | 5 | 3 | 8 | 0 | 0 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 |
9 | 3 | 5 | 0 | 8 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 9 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 7 | 8 | 5 |
10 | 0 | 0 | 5 | 3 | 8 | 0 | 0 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 |
11 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
13 | 5 | 0 | 8 | 0 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 6 | 9 | 0 | 0 | 0 | 0 | 1 | 1 | 5 | 8 | 5 | 0 | 0 | 0 |
14 | 0 | 2 | 0 | 5 | 0 | 8 | 0 | 0 | 6 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 5 | 0 | 5 | 0 | 8 |
15 | 5 | 0 | 0 | 0 | 9 | 0 | 2 | 0 | 0 | 0 | 2 | 6 | 9 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 5 | 0 | 5 |
16 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 6 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 0 |
17 | 5 | 0 | 0 | 0 | 0 | 0 | 8 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 5 | 0 | 0 | 0 |
18 | 0 | 0 | 8 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 0 | 0 | 0 | 0 |
19 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Week | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | 5 | 0 | 8 | 4 | 0 | 0 | 0 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
2 | 5 | 0 | 8 | 4 | 0 | 0 | 2 | 7 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
3 | 5 | 3 | 8 | 4 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 0 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
4 | 5 | 3 | 8 | 4 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 0 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
5 | 5 | 3 | 8 | 0 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 0 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
6 | 5 | 3 | 8 | 0 | 0 | 0 | 2 | 7 | 3 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
7 | 5 | 3 | 8 | 0 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
8 | 5 | 3 | 8 | 0 | 0 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
9 | 5 | 3 | 8 | 0 | 9 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
10 | 5 | 3 | 8 | 0 | 0 | 0 | 2 | 7 | 3 | 0 | 2 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 7 | 0 | 0 |
11 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
13 | 5 | 0 | 8 | 0 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 6 | 9 | 0 | 0 | 0 | 0 | 1 | 1 | 5 | 8 | 5 | 0 | 0 | 0 |
14 | 5 | 0 | 8 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 2 | 6 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 5 | 8 | 5 | 0 | 0 | 0 |
15 | 5 | 0 | 0 | 0 | 9 | 0 | 2 | 0 | 0 | 0 | 2 | 6 | 9 | 0 | 0 | 0 | 0 | 1 | 1 | 5 | 0 | 5 | 0 | 0 | 0 |
16 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 5 | 0 | 0 | 0 |
17 | 5 | 0 | 8 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 8 | 5 | 0 | 0 | 0 |
18 | 0 | 0 | 8 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 0 | 0 | 0 | 0 |
19 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Han, X.; Wang, D. Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming. Algorithms 2025, 18, 158. https://doi.org/10.3390/a18030158
Han X, Wang D. Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming. Algorithms. 2025; 18(3):158. https://doi.org/10.3390/a18030158
Chicago/Turabian StyleHan, Xu, and Dian Wang. 2025. "Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming" Algorithms 18, no. 3: 158. https://doi.org/10.3390/a18030158
APA StyleHan, X., & Wang, D. (2025). Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming. Algorithms, 18(3), 158. https://doi.org/10.3390/a18030158