An Investigation towards Hostel Space Allocation Problem with Stochastic Algorithms

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.

[1]  Rayner Alfred,et al.  A Constraint Programming Approach to Solving University Course Timetabling Problem (UCTP) , 2017 .

[2]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[3]  David Pisinger.  An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[4]  Rayner Alfred,et al.  A PSO Inspired Asynchronous Cooperative Distributed Hyper-Heuristic for Course Timetabling Problems , 2017 .

[5]  G. Dueck.  New optimization heuristics , 1993 .

[6]  Rayner Alfred,et al.  Comparison of Simulated Annealing and Great Deluge Algorithms for University Course Timetabling Problems (UCTP) , 2017 .

[7]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[8]  Rayner Alfred,et al.  The Study of Genetic Algorithm Approach to Solving University Course Timetabling Problem , 2017 .

[9]  Rayner Alfred,et al.  Performance Comparison of Linear and Non-Linear Great Deluge Algorithms in Solving University Course Timetabling Problems , 2017 .

[10]  Graham Kendall,et al.  The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution , 2010, Eur. J. Oper. Res..

[11]  M. Montaz Ali,et al.  A multi-level genetic algorithm for a multi-stage space allocation problem , 2010, Math. Comput. Model..

[12]  D. Landa-Silva,et al.  Great deluge with non-linear decay rate for solving course timetabling problems , 2008, 2008 4th International IEEE Conference Intelligent Systems.

[13]  Rayner Alfred,et al.  A Performance Comparison of Metaheuristics Search for University Course Timetabling Problems , 2017 .

[14]  Ruibin Bai,et al.  An investigation of novel approaches for optimising retail shelf space allocation , 2005 .

[15]  Colin O. Benjamin,et al.  Planning Facilities at the University of Missouri-Rolla , 1992 .

[16]  Joe Henry Obit,et al.  Non-linear great deluge with learning mechanism for solving the course timetabling problem , 2009 .

[17]  Peter I. Cowling,et al.  Three Methods to Automate the Space Allocation Process in UK Universities , 2000, PATAT.

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Joe Henry Obit,et al.  Comparing hybrid constructive heuristics for university course timetabling , 2011 .

[20]  Djamila Ouelhadj,et al.  Non-linear great deluge with reinforcement learning for university course timetabling , 2011 .