Abstract
In a periodic examination and a general entrance examination of a university, examination proctors are needed in order to smoothly and rigorously carry out the examination. Since such an examination is typically executed at many sites at the same time, many examination proctors are required and they must be assigned appropriately. When assigning proctors, there are a wide range of constraints to be considered. When all the constraints are not satisfied, it is necessary to obtain a solution that satisfies the constraints as much as possible by minimizing the total of the penalties for the soft constraints. In this way, the examination proctors assignment problem can be formulated as an optimization problem. We formulate the problem of assigning proctors as an integer programming problem. Furthermore, we design an algorithm based on the 2-opt method of local search which is one of the meta-heuristic algorithms. The performance of the proposed algorithm is evaluated by applying it to some periodic examination assignment with actual sizes. As a result, the proposed algorithm can output a feasible solution of a local minimum, even if the size of an instance of the problem is large and the optimization solver cannot solve it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Schaerf, A.: Local search techniques for large high school timetabling problems. IEEE Trans. Syst. Man Cybern. Part A Syst. Humans 29(4), 368–377 (1999)
Aycan, E., Ayav, T.: Solving the course scheduling problem using simulated annealing. In: 2009 IEEE International Advance Computing Conference, pp. 462–466 (2009)
Al Tarawneh, H.Y., Ayob, M.: Using tabu search with multi-neighborhood structures to solve university course timetable UKM case study. In: 2011 3rd Conference on Data Mining and Optimization (DMO), pp. 208–212 (2011)
Sigl, B., Golub, M., Mornar, V.: Solving timetable scheduling problem using genetic algorithms. In: 25th International Conference on Information Technology Interfaces IT1, pp. 231–259 (2003)
Miller, H.E., Pierskalla, W.P., Rath, G.J.: Nurse scheduling using mathematical programming. Oper. Res. 24(5), 797–1026 (1976)
Aickelin, U., White, P.: Building better nurse scheduling algorithms. Ann. Oper. Res. 128, 159–177 (2004)
Aykin, T.: Optimal shift scheduling with multiple break windows. Manage. Sci. 42(4), 475–627 (1996)
Raghavjee, R., Pillay, N.: A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem. ORiON 31(1), 39–60 (2015)
Hoong Chuin Lau: On the complexity of manpower shift scheduling. Comput. Oper. Res. 23(1), 93–102 (1996)
Goncalves, J.F., de Magalhaes Mendes, J.J., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77–95 (2005)
GUROBI OPTIMAZATION Documantation. https://www.gurobi.com/documentation/
Acknowledgements
This work was partially supported by the Japan Society for the Promotion of Science through Grants-in-Aid for Scientific Research (B) (17H01742) and JST CREST JPMJCR1402.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nishikawa, T., Miwa, H. (2022). Algorithm Based on Local Search Method for Examination Proctors Assignment Problem Considering Various Constraints. In: Barolli, L., Chen, HC., Miwa, H. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2021. Lecture Notes in Networks and Systems, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-030-84910-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-84910-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-84909-2
Online ISBN: 978-3-030-84910-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)