Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
From MaRDI portal
(Redirected from Publication:300032)
Recommendations
- Metaheuristics for university course timetabling
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- scientific article; zbMATH DE number 1054932
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 883043 (Why is no real title available?)
- A clique-based algorithm for constructing feasible timetables
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A robust simulated annealing based examination timetabling system.
- A survey of metaheuristic-based techniques for university timetabling problems
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Adaptive tabu search for course timetabling
- An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
- An effective hybrid algorithm for university course timetabling
- An improved ant colony optimisation heuristic for graph colouring
- Auction algorithms for network flow problems: A tutorial introduction
- Compactness and balancing in scheduling
- Hybrid evolutionary algorithms for graph coloring
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Modeling and Solving the Train Timetabling Problem
- Modeling staff scheduling problems. A tutorial
- On the application of graph colouring techniques in round-robin sports scheduling
- Optimization by simulated annealing
- Scheduling in sports: an annotated bibliography
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Solving the post enrolment course timetabling problem by ant colony optimization
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)
