Bee Colony Algorithm for Proctors Assignment

Nashat Mansour, Mohamad Kassem Taha

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.

Keywords


Bee colony algorithm; constraint-based assignment; intelligent computing; meta-heuristics; proctor assignment

References


R. Marti, H. Lourenco, and M. Laguna, “Assigning proctors to exams with scatter search,” Journal of Computer Science Interfaces, vol. 12, no. 37, pp. 215–227, 2000.

R. Awad and J. Chinneck, “Proctor assignment at Carleton University,” Interfaces, vol. 28, no. 2, pp. 58–71, 1998.

A. Lamghari and J.A. Ferland, “Structured neighborhood tabu search for assigning judges to competitions,” Proceedings of IEEE Symposium on Computational Intelligence in Scheduling, 2007.

N. Mansour, V. Isahakian, and I. Ghalayini, “Scatter search technique for exam timetabling,” Journal of Applied Intelligence, vol. 34, no. 2, pp. 299-310, 2011.

A. Gunawan and K. Ng, “Solving the teacher assignment problem by two metaheuristics,” International Journal of Information and Management Sciences, vol. 22, no. 2, pp. 73–86, 2011.

M. Bowman, L.C. Briand, and Y. Labiche, "Solving the Class Responsibility Assignment Problem in Object-Oriented Analysis with Multi-Objective Genetic Algorithms," IEEE Trans. Software Engineering, vol. 36, no. 6, pp. 817–837, 2010.

D. Karaboga, An idea based on honey bee swarm for numerical optimization, Tech. Rep. TR06, Engineering Faculty, Computer Engineering Department, Erciyes University, 2005.

D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “A comprehensive survey: artificial bee colony (ABC) algorithm and applications,” Artificial Intelligence Review, vol. 42, no. 1, pp. 21–57, 2014.

J. Firoz, M. Rahman, & T. Saha, “Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data,” Proceedings of the 14th Conference on Genetic and Evolutionary Computation, 2012, pp. 201–208.

M. Alzaqebah and S. Abdullah, “Artificial bee colony search algorithm for examination timetabling problems,” International Journal of Physical Sciences, vol. 6, no. 17, pp. 4264–4272, 2011.

A. Bhagade and P. Puranik, “Artificial bee colony (ABC) algorithm for vehicle routing optimization problem,” International Journal of Soft Computing and Engineering, vol. 2, no. 2, pp. 329–333, 2012.

J. Q. Li, Q. K. Pan, S. X. Xie, and S. Wang, “A hybrid artificial bee colony algorithm for flexible job shop scheduling problems,” International Journal of Computers, Communications and Control, vol. 6, no. 2, pp. 286–296, 2011.

A. Banharnsakun, B. Sirinaovakul, and T. “Achalakul, “Job shop scheduling with the best-so-far ABC,” Engineering Applications of Artificial Intelligence, vol. 25, no. 3, pp. 583–593, 2012.

E. Bernardino, A. Bernardino, J. Sánchez-Pérez, J. Gómez-Pulido, and M. Vega-Rodríguez, “Using the bees algorithm to assign terminals to concentrators,” Proceedings of the 23rd International Conference on Industrial Engineering and other Applications of Applied Intelligent Systems, Berlin, Germany, 2010.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

IT in Innovation IT in Business IT in Engineering IT in Health IT in Science IT in Design IT in Fashion

IT in Industry © (2012 - ) · http://www.it-in-industry.org · ISSN (Online): 2203-1731; ISSN (Print): 2204-0595