Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
From MaRDI portal
Publication:300032
DOI10.1016/j.ejor.2014.07.041zbMath1338.90172OpenAlexW2072909099MaRDI QIDQ300032
F. Blanchet-Sadri, M. Dambrine
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/63924/1/EJOR-TT-RLJT.pdf
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)
Related Items (10)
Finding happiness: an analysis of the maximum happy vertices problem ⋮ Operational research in education ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ An effective hybrid local search approach for the post enrolment course timetabling problem ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A methodology for determining an effective subset of heuristics in selection hyper-heuristics ⋮ Improved local search approaches to solve the post enrolment course timetabling problem ⋮ Tackling the maximum happy vertices problem in large networks ⋮ An assignment problem and its application in education domain: a review and potential path ⋮ Scheduling of maintenance work of a large-scale tramway network
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Modeling staff scheduling problems. A tutorial
- On the application of graph colouring techniques in round-robin sports scheduling
- Scheduling in sports: an annotated bibliography
- An effective hybrid algorithm for university course timetabling
- Auction algorithms for network flow problems: A tutorial introduction
- A robust simulated annealing based examination timetabling system.
- 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
- Adaptive tabu search for course timetabling
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An improved ant colony optimisation heuristic for graph colouring
- A survey of metaheuristic-based techniques for university timetabling problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- A clique-based algorithm for constructing feasible timetables
- Modeling and Solving the Train Timetabling Problem
- Compactness and balancing in scheduling
This page was built for publication: Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
