Three improved variants of simulated annealing for optimising dorm room assignments. (16th May 2011)

• Record Type: Journal Article
• Authors: Anh, Duong Tuan; Trung, Nguyen Thanh
• Is Part Of: International journal of intelligent information and database systems. Volume 5:Number 3(2011)
• Page Start: 296
• Page End: 312
• Publication Date: 2011-05-16
• Subjects: dorm room assignments -- DRAs -- informed simulated annealing -- ISA -- very fast simulated re-annealing -- VFSA -- non-monotonic reheating -- student dormitories -- constraint satisfaction; Database management -- Computer programs -- Periodicals; Information retrieval -- Computer programs -- Periodicals; Information storage and retrieval systems -- Computer programs -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligent agents (Computer software) -- Periodicals; 006.33
• Languages: English
• ISSNs: 1751-5858

Abstract

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.