-
Notifications
You must be signed in to change notification settings - Fork 0
/
timesched.ts
396 lines (380 loc) · 16.9 KB
/
timesched.ts
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
import Table from "cli-table3";
import { Allocation, AllocationProblem, NamedRequirements, Resource, ResourceSet } from "./allocator";
import { BruteForce, HillClimb, HillClimbN, Optimiser, SimulatedAnnealing } from "./optimiser";
import { MultipleSelectResourceSet, RandomSelectResourceSet, TimeResource } from "./resourcetypes";
import fs from 'fs';
import { countDuplicates } from "./helpers";
interface StudentGroup extends Resource {
id: string,
tags: string[],
strength: number,
}
interface Faculty extends Resource {
id: string,
tags: string[],
}
interface Room extends Resource {
id: string,
capacity: number,
tags: string[],
}
interface TimeSlot extends Resource {
day: number,
hour: number,
duration: number,
}
interface ExtraResource extends Resource {
id: string,
tags: string[]
}
interface Course {
name: string,
studentsRequired: (s: StudentGroup) => boolean,
facultyRequired: (f: Faculty) => boolean,
roomsRequired: (r: Room) => boolean,
timeSlotRequired: (t: TimeSlot) => boolean,
extraResourcesRequired: ((t: ExtraResource) => boolean)[]
weeklyFrequency: number
}
interface TimeTableInputs {
days: number,
hours: number,
Students: StudentGroup[],
Faculties: Faculty[],
Rooms: Room[],
ExtraResources: ExtraResource[]
Courses: Course[],
lunchHours: number[],
penalties: {
overlap: number,
lateday: number,
nolunch: number,
repeatSubject: number,
consistencyBonusSub: number,
consistencyBonusRoom: number,
consistencyBonusFac: number,
timePref: number,
}
timepreference: number[][],
config: {
steps: number,
optimiser: (a: AllocationProblem) => Optimiser
}
}
type TimeTable = Allocation;
class TimeSched {
public Students = new MultipleSelectResourceSet();
public Faculties = new RandomSelectResourceSet();
public Rooms = new RandomSelectResourceSet();
public ExtraResources = new RandomSelectResourceSet();
public TimeSlots;
private allocationProblem: AllocationProblem;
constructor(public data: TimeTableInputs) {
// process data
this.TimeSlots = new TimeResource(data.days, data.hours);
for (const stGrp of data.Students) {
this.Students.addResource(stGrp);
}
for (const fac of data.Faculties) {
this.Faculties.addResource(fac);
}
for (const room of data.Rooms) {
this.Rooms.addResource(room);
}
for (const res of data.ExtraResources) {
this.ExtraResources.addResource(res);
}
// create list
const ReqList: NamedRequirements[] = [];
for (const course of data.Courses) {
for (let i = 0; i < course.weeklyFrequency; i++) {
ReqList.push({
name: course.name + `.${i}`,
requirements: [
[this.Students, course.studentsRequired as (r: Resource) => boolean],
[this.Faculties, course.facultyRequired as (r: Resource) => boolean],
[this.TimeSlots, course.timeSlotRequired as (r: Resource) => boolean],
[this.Rooms, course.roomsRequired as (r: Resource) => boolean],
...course.extraResourcesRequired.map((fxn: (e: ExtraResource) => boolean): [ResourceSet, (r: Resource) => boolean] => {
return [this.ExtraResources, fxn as (r: Resource) => boolean];
}),
]
});
}
}
this.allocationProblem = new AllocationProblem(ReqList, (t) => this.evaluateTimeTable(t));
}
evaluateTimeTable(t: TimeTable): number {
let penalty = 0;
//////////////////////////////////////////////////////////////////
/// FIND DUPLICATES AND ASSIGN PENALTY
let m1 = new Map<string, number>(); // count student group conflicts
let m2 = new Map<string, number>(); // count faculty conflicts
let m3 = new Map<string, number>(); // count room conflicts
t.assignment.forEach((rlist, key) => {
const slist = rlist[0] as StudentGroup[];
const fac = rlist[1] as Faculty;
const ts = rlist[2] as TimeSlot;
const room = rlist[3] as Room;
for (const studentgrp of slist) {
for (let i = 0; i < ts.duration; i++) {
let t = m1.get(`${studentgrp.id}, ${ts.hour + i}, ${ts.day}`) || 0;
if (t >= 1) {
penalty += t * this.data.penalties.overlap;
}
// also adds time preference penalty and late day penalty
if (ts.hour + i >= this.data.hours)
penalty += this.data.penalties.lateday;
else
penalty += (t + 1) * this.data.timepreference[ts.hour + i][ts.day] * this.data.penalties.timePref;
m1.set(`${studentgrp.id}, ${ts.hour + i}, ${ts.day}`, t + 1);
}
}
{
for (let i = 0; i < ts.duration; i++) {
let t = m2.get(`${fac.id}, ${ts.hour + i}, ${ts.day}`) || 0;
if (t >= 1) {
penalty += t * this.data.penalties.overlap;
}
if (ts.hour + i >= this.data.hours)
penalty += this.data.penalties.lateday;
else
penalty += (t + 1) * this.data.timepreference[ts.hour + i][ts.day] * this.data.penalties.timePref;
m2.set(`${fac.id}, ${ts.hour + i}, ${ts.day}`, t + 1);
}
}
{
for (let i = 0; i < ts.duration; i++) {
let t = m3.get(`${room.id}, ${ts.hour + i}, ${ts.day}`) || 0;
if (t >= 1) {
penalty += t * this.data.penalties.overlap;
}
if (ts.hour + i >= this.data.hours)
penalty += this.data.penalties.lateday;
m3.set(`${room.id}, ${ts.hour + i}, ${ts.day}`, t + 1);
}
}
})
//////////////////////////////////////////////////////////////////
// lunchtime for students
for (const studentgrp of this.Students.allResources) {
for (let i = 0; i < this.data.days; i++) {
let lunchfound = false;
for (const hr of this.data.lunchHours) {
let t = m1.get(`${studentgrp.id}, ${hr}, ${i}`) || 0;
if (t == 0) {
lunchfound = true;
}
}
if (!lunchfound)
penalty += this.data.penalties.nolunch;
}
}
// lunchtime for faculties
for (const fac of this.Faculties.allResources) {
for (let i = 0; i < this.data.days; i++) {
let lunchfound = false;
for (const hr of this.data.lunchHours) {
let t = m2.get(`${fac.id}, ${hr}, ${i}`) || 0;
if (t == 0) {
lunchfound = true;
}
}
if (!lunchfound)
penalty += this.data.penalties.nolunch;
}
}
//////////////////////////////////////////////////////////////////
// Subject repeat and consistency
let sv = new Map<string, [string, Faculty, Room]>(); // student view
t.assignment.forEach((rlist, course_name) => {
const slist = rlist[0] as StudentGroup[];
const fac = rlist[1] as Faculty;
const ts = rlist[2] as TimeSlot;
const room = rlist[3] as Room;
for (const studentgrp of slist) {
for (let i = 0; i < ts.duration; i++) {
const cell_id = `${studentgrp.id}, ${ts.hour + i}, ${ts.day}`;
sv.set(cell_id, [course_name, fac, room]);
}
}
});
const course_name = (details: [string, Faculty, Room] | undefined) => (details || ['.0'])[0].split('.')[0];
const faculty_name = (details: [string, Faculty, Room] | undefined) => (details) ? details[1].id : '';
const room_name = (details: [string, Faculty, Room] | undefined) => (details) ? details[2].id : '';
// Subject repeat penalty
for (const studentgrp of this.Students.allResources) {
for (let day = 1; day < this.data.days; day++) {
const courses_this_day = [];
for (let hour = 0; hour < this.data.hours; hour++) {
const cell_id = `${studentgrp.id}, ${hour}, ${day}`;
courses_this_day.push(course_name(sv.get(cell_id)));
}
penalty += countDuplicates(courses_this_day) * this.data.penalties.repeatSubject;
}
}
// consistency bonus
for (const studentgrp of this.Students.allResources) {
for (let day = 0; day < this.data.days; day++) {
for (let hour = 0; hour < this.data.hours; hour++) {
const cell_id = `${studentgrp.id}, ${hour}, ${day}`;
const cell_id_next_day = `${studentgrp.id}, ${hour}, ${day + 1}`;
const cell_id_next_next_day = `${studentgrp.id}, ${hour}, ${day + 2}`;
const cell_id_next_hr = `${studentgrp.id}, ${hour + 1}, ${day}`;
if (course_name(sv.get(cell_id)) == course_name(sv.get(cell_id_next_day))) {
penalty -= this.data.penalties.consistencyBonusSub;
}
if (course_name(sv.get(cell_id)) == course_name(sv.get(cell_id_next_next_day))) {
penalty -= this.data.penalties.consistencyBonusSub;
}
if (room_name(sv.get(cell_id)) == room_name(sv.get(cell_id_next_day))) {
penalty -= this.data.penalties.consistencyBonusRoom;
}
if (room_name(sv.get(cell_id)) == room_name(sv.get(cell_id_next_hr))) {
penalty -= this.data.penalties.consistencyBonusRoom;
}
if (faculty_name(sv.get(cell_id)) == faculty_name(sv.get(cell_id_next_day))) {
penalty -= this.data.penalties.consistencyBonusFac;
}
}
}
}
//////////////////////////////////////////////////////////////////
return - penalty;
}
displayTable(t: TimeTable, view: ResourceSet): string {
// First figure out how to iterate over resource value
let m = new Map<string, {content: string, rowSpan: number}[][]>();
if (view == this.Students) {
this.Students.allResources.forEach((s) => {
const r = s as StudentGroup;
const blankTable = [];
for (let j = 0; j < this.data.hours; j++) {
const row = [];
for (let i = 0; i < this.data.days; i++)
row.push({content: "", rowSpan: 1});
blankTable.push(row);
}
m.set(r.id, blankTable);
})
t.assignment.forEach((rlist, key) => {
const slist = rlist[0] as StudentGroup[];
const fac = rlist[1] as Faculty;
const ts = rlist[2] as TimeSlot;
const room = rlist[3] as Room;
for (const studentgrp of slist) {
const table = m.get(studentgrp.id);
if (table![ts.hour][ts.day].content != '')
table![ts.hour][ts.day].content += `***\n`;
table![ts.hour][ts.day].rowSpan = ts.duration;
table![ts.hour][ts.day].content += `${key.split('.')[0]}\n${fac.id}\n${room.id}`;
for (let i = 1; i < ts.duration && ts.hour + i < this.data.hours; i++) {
table![ts.hour + i][ts.day].content = `^`;
}
}
})
} else if (view == this.Faculties) {
this.Faculties.allResources.forEach((s) => {
const r = s as Faculty;
const blankTable = [];
for (let j = 0; j < this.data.hours; j++) {
const row = [];
for (let i = 0; i < this.data.days; i++)
row.push({content: "", rowSpan: 1});
blankTable.push(row);
}
m.set(r.id, blankTable);
})
t.assignment.forEach((rlist, key) => {
const slist = rlist[0] as StudentGroup[];
const fac = rlist[1] as Faculty;
const ts = rlist[2] as TimeSlot;
const room = rlist[3] as Room;
const table = m.get(fac.id);
if (table![ts.hour][ts.day].content != '')
table![ts.hour][ts.day].content += `***\n`;
table![ts.hour][ts.day].rowSpan = ts.duration;
table![ts.hour][ts.day].content += `${key.split('.')[0]}\n${room.id}\n${slist.map(s => s.id).join('+')}`;
for (let i = 1; i < ts.duration && ts.hour + i < this.data.hours; i++) {
table![ts.hour + i][ts.day].content = `^`;
}
})
} else if (view == this.Rooms) {
this.Rooms.allResources.forEach((s) => {
const r = s as Room;
const blankTable = [];
for (let j = 0; j < this.data.hours; j++) {
const row = [];
for (let i = 0; i < this.data.days; i++)
row.push({content: "", rowSpan: 1});
blankTable.push(row);
}
m.set(r.id, blankTable);
})
t.assignment.forEach((rlist, key) => {
const slist = rlist[0] as StudentGroup[];
const fac = rlist[1] as Faculty;
const ts = rlist[2] as TimeSlot;
const room = rlist[3] as Room;
const table = m.get(room.id);
if (table![ts.hour][ts.day].content != '')
table![ts.hour][ts.day].content += `***\n`;
table![ts.hour][ts.day].rowSpan = ts.duration;
table![ts.hour][ts.day].content += `${key.split('.')[0]}\n${fac.id}\n${slist.map(s => s.id).join('+')}`;
for (let i = 1; i < ts.duration && ts.hour + i < this.data.hours; i++) {
table![ts.hour + i][ts.day].content = `^`;
}
})
} else {
throw new Error("This view is Not Supported!");
}
let str = "";
for (const [name, table] of m) {
const clitable = new Table(
{
colWidths: Array(this.data.days).fill(30), rowHeights: Array(this.data.hours).fill(3),
chars: { 'top': '═', 'top-mid': '╤', 'top-left': '╔', 'top-right': '╗', 'bottom': '═', 'bottom-mid': '╧', 'bottom-left': '╚', 'bottom-right': '╝', 'left': '║', 'left-mid': '╟', 'right': '║', 'right-mid': '╢' },
style: { head: [], border: [], },
wordWrap: true
}
);
for (let i = 0; i < this.data.hours; i++) {
const row = [];
for (let j = 0; j < table[i].length; j++) {
const element = table[i][j];
if (element.content != '^')
row.push(element);
}
clitable.push(row);
}
str += name + '\n' + clitable.toString() + "\n\n";
}
return str;
}
run(saveIf: number, quiet: number = 1) {
const h = this.data.config.optimiser(this.allocationProblem);
for (let i = 0; i < this.data.config.steps; i++) {
h.step();
const c = h.bestSolution() as TimeTable;
if (i % quiet == 0)
console.log(`Iteration`, i+1, `\tValue: `, c.evaluate());
}
const c = h.bestSolution() as TimeTable;
console.log(`Final Value: `, c.evaluate());
let plainobject: any = {};
for (const [key, val] of c.assignment) {
plainobject[key] = val;
}
if (c.evaluate() > saveIf) {
console.log();
fs.writeFileSync('./full_result.json', JSON.stringify(plainobject, null, 2));
fs.writeFileSync('./Students_view.txt', this.displayTable(c, this.Students));
fs.writeFileSync('./Faculties_view.txt', this.displayTable(c, this.Faculties));
fs.writeFileSync('./Rooms_view.txt', this.displayTable(c, this.Rooms));
console.log("Saved results to file!");
console.log();
}
return c.evaluate();
}
}
export { TimeSched }