A comparison of annealing techniques for academic course scheduling | Zendy

M. A. Saleh Elmohamed | Zendy; Paul Coddington | Zendy; Geoffrey Fox | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A comparison of annealing techniques for academic course scheduling

Author(s) -

M. A. Saleh Elmohamed,

Paul Coddington,

Geoffrey Fox

Publication year - 1998

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-64979-4

DOI - 10.1007/bfb0055883

Subject(s) - simulated annealing , computer science , preprocessor , annealing (glass) , adaptive simulated annealing , schedule , scheduling (production processes) , mathematical optimization , algorithm , artificial intelligence , mathematics , materials science , composite material , operating system

In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simulated anneal- ing, including mean-field annealing, simulated annealing with three different cooling schedules, and the use of a rule-based preprocessor to provide a good initial solution for annealing. The best results were obtained using simulated annealing with adaptive cooling and reheating as a function of cost, and a rule-based preprocessor. This approach enabled us to obtain valid schedules for the timetabling problem for a large university, using a complex cost function that includes student preferences. None of the other methods were able to provide a complete valid schedule.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research