Construction of Initial Neighborhoods for a Course Scheduling Problem Using Tiling

Construction of Initial Neighborhoods for a Course Scheduling Problem Using Tiling

A recent competition course scheduling competition saw many solution approaches which constructed an initial solution, and then improved that solution using local search. The initial solution appears to be crucial for the local search to be effective and in this work we propose a tiling technique wh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Moody, D.L., Bar-Noy, A., Kendall, G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computational intelligence
Computer science
Processor scheduling
Scheduling algorithm
Simulated annealing
Solids
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A recent competition course scheduling competition saw many solution approaches which constructed an initial solution, and then improved that solution using local search. The initial solution appears to be crucial for the local search to be effective and in this work we propose a tiling technique which can quickly construct a solution which we hope can be used as a good starting point for a local search procedure
DOI:10.1109/SCIS.2007.367688