Neighborhood size in the Simulated Annealing Algorithm
American Journal of Mathematical and Management Sciences
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Simulated Annealing with estimated temperature
AI Communications - Special issue on AI research in the Benelux
General Cooling Schedules for a Simulated Annealing Based Timetabling System
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Comparison of Annealing Techniques for Academic Course Scheduling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Fleet Scheduling Optimization: A Simulated Annealing Approach
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Simulated annealing with advanced adaptive neighborhood
Second international workshop on Intelligent systems design and application
Informed Simulated Annealing for Optimizing Dorm Room Assignments
ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems
A simulated annealing approach to the travelling tournament problem
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Assigning dorm rooms to thousands of students with complex and interdependent preferences is a difficult constraint satisfaction optimisation problem. In this paper, we describe three methods that were developed to solve the whole dorm room assignment problem. They are three different improved variants of simulated annealing: informed simulated annealing, very fast simulated re-annealing and simulated annealing with non-monotonic reheating. We perform experiments of each of the algorithms on real datasets from the dormitory at HCMC University of Technology. Experimental results show that among the three selected improved variants of simulated annealing, simulated annealing with non-monotonic reheating is the most suitable algorithm to be applied to the dorm room assignment problem.