Abstract
This research presents the study of stochastic algorithms in one of the limited study in Space Allocation Problem. The domain involves the allocation of students into the available rooms which is known as Hostel Space Allocation Problem. The problem background of this domain which related with hard constraints and soft constraints are discussed and the formal mathematical models of constraints in Universiti Malaysia Sabah Labuan International Campus are presented. The construction of initial solution is handled by Constraint Programming algorithm. Two algorithms mainly Great Deluge with linear and non-linear decay rate and Simulated Annealing with linear reduction are proposed to improve the quality of solution. The experimental results show that Simulated Annealing with linear reduction temperature performs well in this domain.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adewumi, A. O., & Ali, M. M.: A multi-level genetic algorithm for a multi-stage space allocation problem. Mathematical and Computer Modelling, 51(1-2), 109-126 (2010).
Bai, R.: An investigation of novel approaches for optimising retail shelf space allocation. Doctoral dissertation, University of Nottingham (2005).
Benjamin, C. O., Ehie, I. C., & Omurtag, Y.: Planning facilities at the University of Missouri-Rolla. Interfaces, 22(4), 95-105 (1992).
Burke, E. K., Cowling, P., Silva, J. L., & McCollum, B.: Three methods to automate the space allocation process in UK universities. In International Conference on the Practice and Theory of Automated Timetabling , pp. 254-273. Springer, Berlin, Heidelberg (2000).
Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. Journal of Computational physics, 104(1), 86-92 (1993).
Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers & operations research, 13(5), 533-549 (1986).
Junn, K. Y., Obit, J. H., & Alfred, R.: A Constraint Programming Approach to Solving University Course Timetabling Problem (UCTP). Advanced Science Letters, 23(11), 11023-11026 (2017).
Junn, K. Y., Obit, J. H., & Alfred, R.: Comparison of Simulated Annealing and Great Deluge Algorithms for University Course Timetabling Problems (UCTP). Advanced Science Letters, 23(11), 11413-11417 (2017).
Junn, K. Y., Obit, J. H., & Alfred, R.: The Study of Genetic Algorithm Approach to Solving University Course Timetabling Problem. In International Conference on Computational Science and Technology, pp. 454-463. Springer, Singapore (2017).
Kahar, M. N. M., & Kendall, G.: The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution. European Journal of Operational Research, 207(2), 557-565 (2010).
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P.: Optimization by simulated annealing. science, 220(4598), 671-680 (1983).
Landa Silva, J. D.: Metaheuristic and multiobjective approaches for space allocation. Doctoral dissertation, University of Nottingham (2003).
Landa-Silva, D., & Obit, J. H.: Comparing Hybrid Constructive Heuristics for University Course Timetabling (2011).
Obit, J. H., Alfred, R., & Abdalla, M. H.: A PSO Inspired Asynchronous Cooperative Distributed Hyper-Heuristic for Course Timetabling Problems. Advanced Science Letters, 23(11), 11016-11022 (2017).
Obit, J. H., Junn, K. Y., & Alfred, R.: A Performance Comparison of Metaheuristics Search for University Course Timetabling Problems. Advanced Science Letters, 23(11), 11012-11015 (2017).
Obit, J. H., Junn, K. Y., & Alfred, R.: Performance Comparison of Linear and Non-Linear Great Deluge Algorithms in Solving University Course Timetabling Problems. Advanced Science Letters, 23(11), 11027-11030 (2017).
Obit, J. H., Landa-Silva, D., Sevaux, M., & Ouelhadj, D.: Non-linear great deluge with reinforcement learning for university course timetabling. Metaheuristics–Intelligent Decision Making, Series Operations Research/Computer Science Interfaces, 1-19. Springer (2011).
Obit, J. H., Landa-Silva, D., Ouelhadj, D. & Sevaux, M.: Non-linear great deluge with learning mechanism for solving the course timetabling problem. In: 8th Metaheuristics International Conference. MIC (2009).
Pisinger, D.: An exact algorithm for large multiple knapsack problems. European Journal of Operational Research, 114(3), 528-541 (1999).
Wolpert, D. H., & Macready, W. G.: No free lunch theorems for optimization. IEEE transactions on evolutionary computation, 1(1), 67-82 (1997).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Obit, J.H., Junn, K.Y., Alfred, R., Bolongkikit, J., Sheng, O.Y. (2019). An Investigation towards Hostel Space Allocation Problem with Stochastic Algorithms. In: Alfred, R., Lim, Y., Ibrahim, A., Anthony, P. (eds) Computational Science and Technology. Lecture Notes in Electrical Engineering, vol 481. Springer, Singapore. https://doi.org/10.1007/978-981-13-2622-6_23
Download citation
DOI: https://doi.org/10.1007/978-981-13-2622-6_23
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2621-9
Online ISBN: 978-981-13-2622-6
eBook Packages: EngineeringEngineering (R0)