Bee colony algorithm for assigning proctors to exams. (c2013)

LAUR Repository

Show simple item record

dc.contributor.author Taha, Mohamad Kassem
dc.date.accessioned 2013-08-22T09:14:36Z
dc.date.available 2013-08-22T09:14:36Z
dc.date.copyright 2013 en_US
dc.date.issued 2013-08-22
dc.date.submitted 2013-06-06
dc.identifier.uri http://hdl.handle.net/10725/1538
dc.description Includes bibliographical references (leaves 60-61). en_US
dc.description.abstract Proctor assignment refers to assigning proctors to exams with the objective of having the appropriate number of proctors assigned to exams, subject to conditions such as minimizing the load of proctoring and preventing any conflicting assignments. This problem is intractable and, hence, heuristics algorithms are needed to provide good solutions. In this thesis, we propose a new solution for the proctor assignment to exams problem based on the Bee Colony meta-heuristic algorithm. The Bee Colony algorithm is a recent population-based search algorithm which imitates the behavior of the swarms of honey bees during the process of collecting food. The algorithm performs a neighborhood search combined with random search. We apply the Bee Colony algorithm to previously published data. Experimental results show good solutions that maximize the preferences of the proctors while preserving the fairness of the workload given to proctors. en_US
dc.language.iso en_US en_US
dc.subject Computer algorithms en_US
dc.subject Scattering (Mathematics) en_US
dc.subject Mathematical optimization en_US
dc.subject Dissertations, Academic en_US
dc.subject Lebanese American University -- Dissertations en_US
dc.title Bee colony algorithm for assigning proctors to exams. (c2013) en_US
dc.type Thesis en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 200402286 en_US
dc.author.commembers Dr. Abbas Tarhini
dc.author.commembers Dr. Azzam Mourad
dc.author.woa OA en_US
dc.description.physdesc 1 bound copy: xiii, 66 leaves; ill.; 30 cm. Available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Nashat Mansour
dc.keywords Proctors en_US
dc.keywords Bee Colony Algorithm en_US
dc.keywords School and University Exams en_US
dc.keywords Constraint based Assignment en_US
dc.keywords Meta-heuristics en_US
dc.keywords NP-Complete Problem en_US
dc.keywords Intractable Problem en_US
dc.identifier.doi https://doi.org/10.26756/th.2013.4 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account