Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem

Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem

Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Khang Nguyen, Tung Pham, Nga Le, Nguyen Dang, Nuong Tran
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Availability
Computational modeling
Educational institutions
Mathematical model
Simulated annealing
Wheels
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.
DOI:10.1109/KSE.2010.31