Random partial neighborhood search for the post-enrollment course timetabling problem
Year of publication: |
February 2018
|
---|---|
Authors: | Nagata, Yuichi |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 90.2018, p. 84-96
|
Subject: | Candidate list | Partial neighborhood | Tabu search | Timetabling | Scheduling-Verfahren | Scheduling problem | Nachbarschaft | Neighbourhood | Heuristik | Heuristics | Theorie | Theory | Wohnstandort | Residential location | Operations Research | Operations research |
-
Effective learning hyper-heuristics for the course timetabling problem
Soria-Alcaraz, Jorge A., (2014)
-
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
Rosati, Roberto Maria, (2022)
-
Robust university course timetabling problem subject to single and multiple disruptions
Gülcü, Ayla, (2020)
- More ...
-
A powerful route minimization heuristic for the vehicle routing problem with time windows
Nagata, Yuichi, (2009)
-
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Nagata, Yuichi, (2010)
-
A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem
Nagata, Yuichi, (2013)
- More ...