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

Includes bibliographical references (leaves 60-61).

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Taha, Mohamad Kassem (author)
التنسيق: masterThesis
منشور في: 2013
الموضوعات:
الوصول للمادة أونلاين:http://hdl.handle.net/10725/1538
https://doi.org/10.26756/th.2013.4
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513456716120064
author Taha, Mohamad Kassem
author_facet Taha, Mohamad Kassem
author_role author
dc.creator.none.fl_str_mv Taha, Mohamad Kassem
dc.date.none.fl_str_mv 2013-08-22T09:14:36Z
2013-08-22T09:14:36Z
2013
2013-08-22
2013-06-06
dc.identifier.none.fl_str_mv http://hdl.handle.net/10725/1538
https://doi.org/10.26756/th.2013.4
dc.language.none.fl_str_mv en_US
dc.publisher.none.fl_str_mv Lebanese American University
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Computer algorithms
Scattering (Mathematics)
Mathematical optimization
Dissertations, Academic
Lebanese American University -- Dissertations
dc.title.none.fl_str_mv Bee colony algorithm for assigning proctors to exams. (c2013)
dc.type.none.fl_str_mv Thesis
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/masterThesis
description Includes bibliographical references (leaves 60-61).
eu_rights_str_mv openAccess
format masterThesis
id LAURepo_7b8d1e0156e5b5237ed488de606d7c24
language_invalid_str_mv en_US
network_acronym_str LAURepo
network_name_str Lebanese American University repository
oai_identifier_str oai:laur.lau.edu.lb:10725/1538
publishDate 2013
publisher.none.fl_str_mv Lebanese American University
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Bee colony algorithm for assigning proctors to exams. (c2013)Taha, Mohamad KassemComputer algorithmsScattering (Mathematics)Mathematical optimizationDissertations, AcademicLebanese American University -- DissertationsIncludes bibliographical references (leaves 60-61).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.1 bound copy: xiii, 66 leaves; ill.; 30 cm. Available at RNL.Lebanese American University2013-08-22T09:14:36Z2013-08-22T09:14:36Z20132013-08-222013-06-06Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/1538https://doi.org/10.26756/th.2013.4en_USinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/15382020-05-18T14:53:55Z
spellingShingle Bee colony algorithm for assigning proctors to exams. (c2013)
Taha, Mohamad Kassem
Computer algorithms
Scattering (Mathematics)
Mathematical optimization
Dissertations, Academic
Lebanese American University -- Dissertations
status_str publishedVersion
title Bee colony algorithm for assigning proctors to exams. (c2013)
title_full Bee colony algorithm for assigning proctors to exams. (c2013)
title_fullStr Bee colony algorithm for assigning proctors to exams. (c2013)
title_full_unstemmed Bee colony algorithm for assigning proctors to exams. (c2013)
title_short Bee colony algorithm for assigning proctors to exams. (c2013)
title_sort Bee colony algorithm for assigning proctors to exams. (c2013)
topic Computer algorithms
Scattering (Mathematics)
Mathematical optimization
Dissertations, Academic
Lebanese American University -- Dissertations
url http://hdl.handle.net/10725/1538
https://doi.org/10.26756/th.2013.4