Ch1_I的ntroduction to OR.pptVIP

Optimization Algorithms What is Operations Research? Problems and Applications Optimization and Algorithms Personal Examples * Outline University Timetabling Hard Constraints: should be satisfied in any case Soft Constraints: should be minimized as far as possible Course Timetabling The CCT problem consists of scheduling all lectures of a set of courses into a weekly timetable in accordance with a given set of constraints: -each lecture of a course ? a period and a room Feasible Timetable: -all lectures have been scheduled at a period and a room. -all the hard constraints are satisfied. Basic Definitions C={c1,…,cn}: a set of n courses, with each course ci being composed of li lectures and being designed a hosting teacher. T={t1,…,tp}: a set of p periods, which is distributed in d week days and h daily timeslots, i.e., p=d*h. R={r1,…,rm}: a set of m rooms, each with a capacity. CR={cr1,…,crs}: a set of s curriculum, where each curriculum is a group of courses sharing common students. Solution Representation The CCT problem consists of assigning a period, room pair for each lecture of a course, such that all hard constraints are strictly satisfied and the total number of soft constraints violations is minimized. A solution can be represented as a p*m matrix X, where xij denotes the lecture of a course scheduled at period ti and room rj. t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 t12 r1 C1 C2 ? C3 C2 C1 ? ? ? ? C1 C1 r2 ? C4 ? ? ? ? ? C1 C5 C3 ? ? r3 C5 ? C3 C5 ? C5 C2 ? C2 ? ? C4 r4 ? ? ? ? C4 ? ? ? ? C5 ? ? r5 ? ? C5 ? ? ? C4 ? ? ? C4 ? Hard Constraints H1. Lectures: All lectures of a course must be scheduled to a distinct period and a room. H2. Room Occupancy: Any two lectures cannot be assigned in the same period and the same room. H3. Conflicts: courses sharing the same students or teacher cannot be scheduled in the same period. H4. Availability: