Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

Optimization by Simulated Annealing
Auction algorithms for network flow problems: A tutorial introduction
Title not available (Why is that?)
On the application of graph colouring techniques in round-robin sports scheduling
A robust simulated annealing based examination timetabling system.
Adaptive tabu search for course timetabling
A survey of metaheuristic-based techniques for university timetabling problems
Setting the research agenda in automated timetabling: the second international timetabling competition
Modeling staff scheduling problems. A tutorial
Scheduling in sports: an annotated bibliography
An effective hybrid algorithm for university course timetabling
A wide-ranging computational comparison of high-performance graph colouring algorithms
Local search and constraint programming for the post enrolment-based course timetabling problem
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
Solving the post enrolment course timetabling problem by ant colony optimization
An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
Hybrid evolutionary algorithms for graph coloring
A graph coloring heuristic using partial solutions and a reactive tabu scheme
An improved ant colony optimisation heuristic for graph colouring
A clique-based algorithm for constructing feasible timetables
Modeling and Solving the Train Timetabling Problem
Compactness and balancing in scheduling
Title not available (Why is that?)

Cited In (10)

Scheduling of maintenance work of a large-scale tramway network
A methodology for determining an effective subset of heuristics in selection hyper-heuristics
An assignment problem and its application in education domain: a review and potential path
Finding happiness: an analysis of the maximum happy vertices problem
Tackling the maximum happy vertices problem in large networks
Operational research in education
Improved local search approaches to solve the post enrolment course timetabling problem
An effective hybrid local search approach for the post enrolment course timetabling problem
Adaptive large neighborhood search for the curriculum-based course timetabling problem
Educational timetabling: problems, benchmarks, and state-of-the-art results

This page was built for publication: Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300032)