Three improved variants of simulated annealing for optimising dorm room assignments
by Duong Tuan Anh, Nguyen Thanh Trung
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 5, No. 3, 2011

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.

Online publication date: Tue, 21-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com