Abstract
Due to the rapid growth of the student population in tertiary institutions in many developing countries, hostel space has become one of the most important resources in university. Therefore, the decision of student selection and hostel room allocation is indeed a critical issue for university administration. This paper proposes a hierarchical heuristics approach to cope with hostel room allocation problem. The proposed approach involves selecting eligible students using rank based selection method and allocating selected students to the most suitable hostel room possible via the implementation of a genetic algorithm (GA). We also have examined the effects of using different weight associated with constraints on the performance of the GA. Results obtained from the experiments illustrate the feasibility of the suggested approach in solving the hostel room allocation problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Zhang, X-F., Koshimura, M., Fujita, H., Hasegawa, R.: Combining PSO and local search to solve scheduling problems, pp. 347–354 (2011)
Adewumi, A.O., Ali, M.M.: A multi-level genetic algorithm for a multi-stage space allocation problem. Math. Comput. Model. 51(1), 109–126 (2010)
Zhang, Q., Manier, H., Marie-Ange, M.: A hybrid metaheuristic algorithm for flexible job-shop scheduling problems with transportation constraints, pp. 441–448 (2012)
Deisemara, F., Reinaldo, M., Socorro, R.: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Comput. Oper. Res. 37, 684–691 (2009)
Seyedali, M., Andrew, L., Sanaz, M.: Confidence measure: a novel metric for robust meta-heuristic optimization algorithms. Inf. Sci. 317, 114–142 (2015)
Yaqin, Z., Beizhi, L., Lv, W.: Study on job-shop scheduling with multi-objectives based on genetic algorithms, vol. 10, pp. 10–294 (2010)
Castelli, M., Vanneschi, L.: Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves. Oper. Res. Lett. 42(5), 355–360 (2014)
Soria-Alcaraz, J., Carpio, M., Puga, H.: A new approach of design for the academic timetabling problem through genetic algorithms, pp. 96–101 (2010)
Yang, H., Wang, M., Chen, Y., Huang, Y., Kao, C.: Crossover based on rough sets-a case of multidimensional knapsack problem, pp. 2411–2415 (2010)
Bennell, J., Soon Lee, L., Potts, C.: A genetic algorithm for two-dimensional bin packing with due dates. Int. J. Prod. Econ. 145(2), 547–560 (2013)
Reeves, C.R.: Modern heuristic techniques for combinatorial problems. Blackwell Scientific, Hoboken (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Alfred, R., Yu, H.F. (2020). Automated Scheduling of Hostel Room Allocation Using Genetic Algorithm. In: Sharma, N., Chakrabarti, A., Balas, V. (eds) Data Management, Analytics and Innovation. Advances in Intelligent Systems and Computing, vol 1042. Springer, Singapore. https://doi.org/10.1007/978-981-32-9949-8_11
Download citation
DOI: https://doi.org/10.1007/978-981-32-9949-8_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-32-9948-1
Online ISBN: 978-981-32-9949-8
eBook Packages: EngineeringEngineering (R0)