A robust simulated annealing based examination timetabling system.
From MaRDI portal
Publication:1406667
DOI10.1016/S0305-0548(97)00101-9zbMath1042.90568OpenAlexW1964072303WikidataQ127754595 ScholiaQ127754595MaRDI QIDQ1406667
Jonathan M. Thompson, Kathryn A. Dowsland
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00101-9
Related Items
Fairness in academic course timetabling ⋮ Comparison of metaheuristic algorithms for examination timetabling problem ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ Adaptive tabu search for course timetabling ⋮ Operational research in education ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ An effective hybrid algorithm for university course timetabling ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ A multiobjective framework for heavily constrained examination timetabling problems ⋮ Optimization in dubbing scheduling ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ A practical three‐phase ILP approach for solving the examination timetabling problem ⋮ Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling ⋮ Solving the examination timetabling problem in GPUs ⋮ An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ A time-dependent metaheuristic algorithm for post enrolment-based course timetabling ⋮ A new model for automated examination timetabling ⋮ Managing the tabu list length using a fuzzy inference system: an application to examination timetabling ⋮ Hybrid variable neighbourhood approaches to university exam timetabling ⋮ On the application of graph colouring techniques in round-robin sports scheduling ⋮ Hybrid heuristics for examination timetabling problem ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing ⋮ Scheduling sports competitions on multiple venues. ⋮ Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy ⋮ A simulated annealing methodology to distribution network design and management
Cites Work
- Unnamed Item
- Unnamed Item
- Some experiments with simulated annealing for coloring graphs
- Tabu search for large scale timetabling problems
- Simulated annealing: A tool for operational research
- A note on the effect of neighborhood structure in simulated annealing
- Some experiments with simulated annealing techniques for packing problems
- Variants of simulated annealing for the examination timetabling problem
- Cooling Schedules for Optimal Annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
