高校自动排课系统.docx

1、高校自动排课系统/简化版高校自动排课系统/排课任务简化后包含：年级专业（教学班级，如计科13）、课程名称、任课教师、上课地点和时间/教学班级简化为不分人数，不分专业方向。/上课教室简化为不分理论课、实验课，不分教室容纳人数，不分是否多媒体。/上课时段简化为：一周五天，周一到周五，白天上课，上午四节，下午四节，/12(8:009:400)、34(10:0011:40)、56(14:0015:40)、78(16:0017:40)/为了便于处理，将五天的所有上课时段用数字019表示/上课地点和时间组合成一个整数数组（位集，bitset），每20个为1组为一个教室的上课时段安排/约束条件：1、教学班级

2、的上课时间不能冲突/2、每个教室不能同时安排多个教学班级上课/3、任课教师的上课时间不能冲突/#include #include #include #include #include #include #include #include using namespace std;/原始数据文件中的每一行数据的数据结构struct schedule string grade_special; /年级专业 string course; /课程名称 string teacher; /任课教师 string total_hour; /总学时 string teach_hour; /讲课学时 string

3、 experiment_hour; /实验学时 string practice_hour; /课程实践学时 string credit; /学分 string week_hour; /周学时 string start_stop; /起止周 string speciality_orientation; /专业方向 string person_num; /人数;/排课任务的数据结构struct arrange arrange(string gs, string c, string t, int ct = -1) : grade_special(gs), course(c), teacher(t),

4、 classroom_time(ct) string grade_special; /年级专业 string course; /课程名称 string teacher; /任课教师 /string classroom; /上课地点 /string time; /上课时间 int classroom_time; /上课地点、时间;/教师倒排表数据结构，通过教师找到该教师的排课情况struct teacher_inverted teacher_inverted(string tea, int cl = -1, int ar = -1) : teacher(tea), class_loc(cl),

5、arrange_loc(ar) string teacher; int class_loc; int arrange_loc;/教室倒排表数据结构，通过教室名称查找该教室的排课情况struct classroom_inverted classroom_inverted(string cr, int cl = -1, int ar = -1) : classroom(cr), class_loc(cl), arrange_loc(ar) string classroom; int class_loc; int arrange_loc;int main(int argc, char* argv)

6、if (argc != 3) cout 程序调用格式错误!n调用格式：csp 排课计划文件 可用教室文件n; return 0; ifstream infile(argv1); vector plan; string s; getline(infile, s); while (getline(infile, s) schedule sch; istringstream record(s); record sch.grade_special sch.course sch.teacher sch.total_hour sch.teach_hour sch.experiment_hour sch.p

7、ractice_hour sch.credit sch.week_hour sch.start_stop sch.speciality_orientation sch.person_num; plan.push_back(sch); infile.close(); vectorvector arranges; /整个系的排课安排 vector arr; /一个班的排课安排 string gs(); /教学班级 for (auto it = plan.begin(); it != plan.end(); +it) if (gs != it-grade_special) if (!arr.empt

8、y() arranges.push_back(arr); /教学计划按教学班级顺序排列 arr.clear(); gs = it-grade_special; arr.push_back(arrange(it-grade_special, it-course, it-teacher); arranges.push_back(arr); vectorvector teachers; /教师数组 for (unsigned i = 0; i arranges.size(); +i) for (unsigned j = 0; j arrangesi.size(); +j) string tea =

9、arrangesij.teacher; if (tea = 未定) continue; unsigned k = 0; for (; k teachers.size(); +k) if (teachersk0.teacher = tea) teachersk.push_back(teacher_inverted(tea, i, j); break; if (k = teachers.size() vector ti; /一个教师的排课信息倒排表 ti.push_back(teacher_inverted(tea, i, j); teachers.push_back(ti); const int

10、 N = 256; bitset ct; /教室时段的分配状况 infile.open(argv2); vector classrooms; /教室数组 while (getline(infile, s) classrooms.push_back(s); infile.close(); unsigned arrange_num = plan.size(); /待排课数目 unsigned class_num = arranges.size(); /教学班级数目 unsigned classroom_num = classrooms.size(); /教室数目 uniform_int_distr

11、ibution u(0, classroom_num * 20 - 1); /为教室时段分配随机数 default_random_engine e(time(0); vector class_loc(class_num, 0); /教学班级已分配状况 unsigned class_cur = 0; /待分配的教学班级序号，轮流为每个班级排课，一次安排一个班的一门课 for (unsigned n = 0; n arrange_num; +n) unsigned k = u(e); /如果某个班级的排课任务已经分配完成，则选择下一个班级继续排课 while (class_locclass_cur

12、 = arrangesclass_cur.size() class_cur = (class_cur + 1) % class_num; /找到待排课任务的对应教师 string tea = arrangesclass_curclass_locclass_cur.teacher; unsigned i = 0; for (; i teachers.size(); +i) if (tea = teachersi0.teacher) break; /找出与该教师无时间冲突的时段 do do while (ct.test(k) k = (k + 1) % (classroom_num * 20);

13、unsigned m = 0; for (; m class_locclass_cur; +m) if (arrangesclass_curm.classroom_time % 20 = k % 20) break; if (m = class_locclass_cur) break; /如果与前面已安排的该班级时间无冲突，则k可用 k = (k + 1) % (classroom_num * 20); /如果有冲突则检查下一个教室时段是否可用 while (1); if (i = teachers.size() break; /教师未定 unsigned j = 0; for (; j te

14、achersi.size(); +j) int m = arrangesteachersij.class_locteachersij.arrange_loc.classroom_time; if (m != -1 & (m % 20 = k % 20) break; if (j = teachersi.size() break; /如果与该教师的时间无冲突，则k可用 k = (k + 1) % (classroom_num * 20); /如果有冲突则检查下一个教室时段是否可用 while (1); /排课 arrangesclass_curclass_locclass_cur.classro

15、om_time = k; ct.set(k); /将当前班级的排课号+1 +class_locclass_cur; /将待排课班级号+1 class_cur = (class_cur + 1) % class_num; loop: /输出 cout tt高校自动排课系统n; cout 选择查询条件：1. 按班级 2. 按教师 3. 按教室n; cout choice; if (-1 = choice) cout 正常退出系统n; return 0; else if (1 = choice) unsigned i = 0, j = 0; for (; i arranges.size(); +i)

16、 cout i . arrangesi0.grade_special t; if (i + 1) % 4 = 0) cout n; cout n; do cout i; if (i = -1) break; else if (i = arranges.size() cout 非法选择n; continue; int class_table45; for (unsigned m = 0; m 4; +m) for (unsigned n = 0; n 5; +n) class_tablemn = -1; for (j = 0; j arrangesi.size(); +j) unsigned m

17、 = arrangesij.classroom_time % 20; class_tablem / 5m % 5 = j; string time_slot4 = 8:00-9:40, 10:00-11:40, 14:00-15:40, 16:00-17:40 ; cout setiosflags(ios_base:left); cout setw(54) arrangesi0.grade_special 班级课程表n; cout =n; cout setw(12) setw(24) 星期一 setw(24) 星期二 setw(24) 星期三 setw(24) 星期四 setw(24) 星期五

18、 n; for (unsigned m = 0; m 4; +m) if (m % 2 = 0) cout =n; else cout -n; for (unsigned m1 = 0; m1 3; +m1) if (m1 = 1) cout setw(12) time_slotm; else cout setw(12) ; for (unsigned n = 0; n 5; +n) if (class_tablemn != -1) j = class_tablemn; if (m1 = 0) cout setw(24) arrangesij.course; else if (m1 = 1)

19、cout setw(24) classroomsarrangesij.classroom_time / 20; else cout setw(24) arrangesij.teacher; else cout setw(24) ; cout n; cout =n; cout resetiosflags(ios_base:left); while (1); else if (2 = choice) unsigned i = 0, j = 0; for (; i teachers.size(); +i) cout i . teachersi0.teacher t; if (i + 1) % 4 =

20、 0) cout n; cout n; do cout i; if (i = -1) break; else if (i = teachers.size() cout 非法选择n; continue; int class_table45; for (unsigned m = 0; m 4; +m) for (unsigned n = 0; n 5; +n) class_tablemn = -1; for (j = 0; j teachersi.size(); +j) unsigned m = arrangesteachersij.class_locteachersij.arrange_loc.

21、classroom_time / 20; class_tablem / 5m % 5 = j; string time_slot4 = 8:00-9:40, 10:00-11:40, 14:00-15:40, 16:00-17:40 ; cout setiosflags(ios_base:left); cout setw(54) teachersi0.teacher 老师课程表n; cout =n; cout setw(12) setw(24) 星期一 setw(24) 星期二 setw(24) 星期三 setw(24) 星期四 setw(24) 星期五 n; for (unsigned m

22、= 0; m 4; +m) if (m % 2 = 0) cout =n; else cout -n; for (unsigned m1 = 0; m1 3; +m1) if (m1 = 1) cout setw(12) time_slotm; else cout setw(12) ; for (unsigned n = 0; n 5; +n) if (class_tablemn != -1) j = class_tablemn; if (m1 = 0) cout setw(24) arrangesteachersij.class_locteachersij.arrange_loc.course; else if (m1 = 1) cout setw(24) classroomsarrangesteachersij.class_locteachersij.arrange_loc.classroom_time / 20; else cout setw(24) arrangesteache