CSC 411 - Revision history

Alchemyst: /* Project allocation */

2010-02-19T04:46:41Z

‎Project allocation

Alchemyst: /* Project allocation */

2009-10-29T07:44:30Z

‎Project allocation

Alchemyst at 06:46, 29 October 2009

2009-10-29T06:46:44Z

Alchemyst: /* Project allocation */

2009-10-29T06:38:56Z

‎Project allocation

Alchemyst at 06:27, 29 October 2009

2009-10-29T06:27:57Z

AndreC: Created page with '4th Year'

2009-04-02T15:41:13Z

Created page with '4th Year'

New page

[[Category:Modules|4th Year]]

@@ Line 9: / Line 9: @@
 * each lecturer, expressed a preference for his/her project where 1 denotes first choice, etc.
-The assignment is done in a way that minimises an objective function (called "unhappiness") of the form: <math>\min_{a} \alpha*s(a) + (1-\alpha)l(a)</math>, where the scores (<math>s(a)</math> for student scores and <math>l(a)</math> for lecturer scores) are calculated from the assignments (<math>a</math>) and the preferences.  <math>\alpha</math> is chosen to favour the students (it is currently 0.95).
+The assignment is done in a way that minimises an objective function (called "unhappiness") of the form: <math>\min_{a} \alpha \times s(a) + (1-\alpha)\times l(a)</math>, where the scores (<math>s(a)</math> for student scores and <math>l(a)</math> for lecturer scores) are calculated from the assignments (<math>a</math>) and the preferences.  <math>\alpha</math> is chosen to favour the students (it is currently 0.95).
 Certain constraints have to be taken into account:

@@ Line 6: / Line 6: @@
 The allocation of projects done by solving a a [http://en.wikipedia.org/wiki/Linear_programming Mixed Integer Linear Programming] problem defined by balancing the needs of
-* Each student, expressed as preference for 10 projects.  1 denotes first choice, 10 denotes last choice and
+* each student, expressed as preference for 10 projects.  1 denotes first choice, 10 denotes last choice and
-* each lecturer, expressed a preference for his/her project were 1 denotes first choice, etc.
+* each lecturer, expressed a preference for his/her project where 1 denotes first choice, etc.
 The assignment is done in a way that minimises an objective function (called "unhappiness") of the form: <math>\min_{a} \alpha*s(a) + (1-\alpha)l(a)</math>, where the scores (<math>s(a)</math> for student scores and <math>l(a)</math> for lecturer scores) are calculated from the assignments (<math>a</math>) and the preferences.  <math>\alpha</math> is chosen to favour the students (it is currently 0.95).

@@ Line 1: / Line 1: @@
 [[Category:Modules|4th Year]]
-During the CSC 411 (Research Project) course, students will gain understanding of research over the course of a long-term project that will take them a year.  This course is closely associated with [CSC 421].
+During this course, students will gain understanding of research over the course of a long-term project that will take them a year.  This course is closely associated with [[CSC 421]].
-−
 ==Project allocation==

@@ Line 10: / Line 10: @@
 * each lecturer, expressed a preference for his/her project were 1 denotes first choice, etc.
-The assignment is done in a way that minimises an objective function (called "unhappiness") of the form: <math>\min_{a} \alpha*studentscore + (1-\alpha)lecturerscore</math>, where the scores are calculated from the assignments and the preferences.  <math>\alpha</math> is chosen to favour the students (it is currently 0.95).
+The assignment is done in a way that minimises an objective function (called "unhappiness") of the form: <math>\min_{a} \alpha*s(a) + (1-\alpha)l(a)</math>, where the scores (<math>s(a)</math> for student scores and <math>l(a)</math> for lecturer scores) are calculated from the assignments (<math>a</math>) and the preferences.  <math>\alpha</math> is chosen to favour the students (it is currently 0.95).
 Certain constraints have to be taken into account:

← Older revision		Revision as of 06:27, 29 October 2009
Line 1:		Line 1:
	[[Category:Modules\|4th Year]]		[[Category:Modules\|4th Year]]
		+
		+	During the CSC 411 (Research Project) course, students will gain understanding of research over the course of a long-term project that will take them a year. This course is closely associated with [CSC 421].
		+
		+
		+	==Project allocation==
		+	The allocation of projects done by solving a a [http://en.wikipedia.org/wiki/Linear_programming Mixed Integer Linear Programming] problem defined by balancing the needs of
		+
		+	* Each student, expressed as preference for 10 projects. 1 denotes first choice, 10 denotes last choice and
		+	* each lecturer, expressed a preference for his/her project were 1 denotes first choice, etc.
		+
		+	The assignment is done in a way that minimises an objective function (called "unhappiness") of the form: <math>\min_{a} \alpha*studentscore + (1-\alpha)lecturerscore</math>, where the scores are calculated from the assignments and the preferences. <math>\alpha</math> is chosen to favour the students (it is currently 0.95).
		+
		+	Certain constraints have to be taken into account:
		+	* each student must get a project
		+	* lecturers have a minimum and maximum number of projects (usually 3 and 5 with some exceptions)
		+	* projects have a minimum and maximum number of students. These are normally 0 and 1, but some projects may be assigned to more than one student.
		+
		+	These constraints mean that the objective function may be larger than the optimal assignment without these constraints. In rare cases this may force some students to get a project they have not chosen assigned to them.
		+
		+	In addition, as there are many equivalent solutions that have the same objective function value in terms of student unhappines, the aggregate mark for each student is used as a "tie breaker". A sensitivity analysis is performed to see the effect of varying tweaks on the student unhappiness, and most tweaks are only allowed if they do not affect the student unhappiness.