Improved local search approaches to solve the post enrolment course timetabling problem
Year of publication: |
16 August 2017
|
---|---|
Authors: | Say Leng Goh ; Kendall, Graham ; Sabar, Nasser R. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 261.2017, 1 (16.8.), p. 17-29
|
Subject: | Timetabling | Combinatorial optimization | Local search | Tabu Search with Sampling and Perturbation (TSSP) | Simulated Annealing with Reheating (SAR) | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Suchtheorie | Search theory | Algorithmus | Algorithm |
-
Parallel local search algorithms for high school timetabling problems
Saviniec, Landir, (2018)
-
Iterated local search with tabu search for the weighted vertex coloring problem
Nogueira, Bruno, (2021)
-
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
Zheng, Jiongzhi, (2022)
- More ...
-
Say Leng Goh, (2019)
-
An effective hybrid local search approach for the post enrolment course timetabling problem
Goh, Say Leng, (2020)
-
A honey-bee mating optimization algorithm for educational timetabling problems
Sabar, Nasser R., (2012)
- More ...