Jump to content

Effective Local Search Algorithms for High School Timetabling Problems: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

12 May 2026

  • curprev 04:3304:33, 12 May 2026 Dcadmin talk contribs 2,077 bytes +2,077 Created page with "by: '''Saviniec, L. and Constantino, A. A.''' '''Highlights''' - We propose Iterated Local Search and Variable Neighborhood Search based algorithms for high school timetabling problems. - We devise two generic neighborhood operators that can be easily adapted to similar problems. - The hybridization between these neighborhood operators improves hugely the effectiveness of local search procedures. - The proposed algorithms outperform state-of-the-art approaches in tw..."
Retrieved from "https://dc.ifors.org/index.php/Effective_Local_Search_Algorithms_for_High_School_Timetabling_Problems"