.

Bee Colony Algorithm for Proctors Assignment.

LAUR Repository

Show simple item record

dc.contributor.author Mansour, Nashat
dc.contributor.author Taha, Mohamad Kassem
dc.date.accessioned 2018-05-16T10:47:50Z
dc.date.available 2018-05-16T10:47:50Z
dc.date.copyright 2015 en_US
dc.identifier.uri http://hdl.handle.net/10725/7833
dc.description.abstract Proctor assignment refers to assigning proctors to examinations with the objective of having the appropriate number of proctors assigned to examinations, 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 find good solutions. In this paper, we propose a new solution for the proctor assignment problem based on the Bee Colony meta-heuristic algorithm. The Bee Colony algorithm is a recent population-based search algorithm that mimics the natural behavior of swarms of honey bees during the process of collecting food. The algorithm performs a neighborhood search combined with a random search to balance exploration and exploitation. The food source identified by a honey bee is associated with a candidate solution to the proctors assignment problem. The search accomplished by three types of bees over a number of iterations aiming to find the source with the highest nectar value (fitness value of a candidate solution). We apply the Bee Colony algorithm to previously published data. Experimental results show good solutions that maximize the preferences of proctors while preserving the fairness of the workload given to proctors. The results also show that the Bee Colony algorithm outperforms other methods on most subject problems. en_US
dc.language.iso en en_US
dc.title Bee Colony Algorithm for Proctors Assignment. en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 198629170 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal Information technology in industy en_US
dc.journal.volume 3 en_US
dc.journal.issue 2 en_US
dc.article.pages 59-63 en_US
dc.keywords Bee colony algorithm en_US
dc.keywords Constraint-based assignment en_US
dc.keywords Intelligent computing en_US
dc.keywords Meta-heuristic en_US
dc.keywords Proctor assignment en_US
dc.identifier.ctation Mansour, N., & Taha, M. K. (2015). Bee Colony Algorithm for Proctors Assignment. INFORMATION TECHNOLOGY IN INDUSTRY, 3(2), 59-63. en_US
dc.author.email nmansour@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url http://203.83.208.81/index.php/itii/article/view/46 en_US
dc.orcid.id https://orcid.org/0000-0002-3603-8284 en_US
dc.author.affiliation 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

Browse

My Account