Metaheuristics for high school timetabling

DOI10.1023/A:1018354324992MaRDI QIDQ1380726zbMATH OpenOpenAlexWikidataFDO

Authors Alberto Colorni, Marco Dorigo, Vittorio Maniezzo

Publication date 11 March 1998

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018354324992

zbMATH Keywords

simulated annealinggenetic algorithmsmetaheuristic algorithmstabu-searchtimetable problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1054932
• A computational study of local search algorithms for Italian high-school timetabling
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• Hybrid genetic algorithms for timetabling

Cited in

(35)

• A comparative study of modern heuristics on the school timetabling problem
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• A computational study of local search algorithms for Italian high-school timetabling
• A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
• Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
• Integrating matheuristics and metaheuristics for timetabling
• A SA-VNS approach for the high school timetabling problem
• A stochastic local search algorithm with adaptive acceptance for high-school timetabling
• GOAL solver: a hybrid local search based solver for high school timetabling
• A decomposed metaheuristic approach for a real-world university timetabling problem
• School timetabling for quality student and teacher schedules
• Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
• Cyclic transfers in school timetabling
• A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools
• scientific article; zbMATH DE number 1728529 (Why is no real title available?)
• A probabilistic cooperative-competitive hierarchical model for global optimization
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university
• Case-based heuristic selection for timetabling problems
• School timetabling problem
• SCHOOL SCHEDULING USING THRESHOLD ACCEPTING
• Late acceptance hill-climbing for high school timetabling
• scientific article; zbMATH DE number 1954163 (Why is no real title available?)
• scientific article; zbMATH DE number 1783852 (Why is no real title available?)
• Parallel local search algorithms for high school timetabling problems
• Subcost-guided search -- experiments with timetabling problems
• A survey of school timetabling research
• Towards constraint-based school timetabling
• A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
• Mathematical models and algorithms for a high school timetabling problem
• Solving Time-Tabling Problems Using Evolutionary Algorithms and Heuristics Search
• A survey of metaheuristic-based techniques for university timetabling problems
• scientific article; zbMATH DE number 1786131 (Why is no real title available?)
• An XML format for benchmarks in high school timetabling
• Strong bounds with cut and column generation for class-teacher timetabling

This page was built for publication: Metaheuristics for high school timetabling

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