A Simulated Annealing Genetic Algorithm for Solving Timetable Problems

DOI10.1007/978-3-642-38667-1_36MaRDI QIDQ4982175zbMATH OpenOpenAlexFDO

Authors Yi-Jie Dun, Qian Wang, Yabin Shao

Publication date 24 March 2015

Published in Fuzzy Information & Engineering and Operations Research & Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38667-1_36

zbMATH Keywords

simulated annealingmetaheuristicsgenetic algorithmscourse timetabling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solving the timetable problem with multiple constraints using genetic algorithms
• Optimizing simulated annealing schedules with genetic programming
• scientific article; zbMATH DE number 1215040
• Solving Scheduling Problems by Simulated Annealing
• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• scientific article; zbMATH DE number 1159196
• A genetic algorithm methodology for complex scheduling problems

Cites work

• scientific article; zbMATH DE number 1488089 (Why is no real title available?)
• A survey of metaheuristic-based techniques for university timetabling problems
• An effective hybrid algorithm for university course timetabling
• Metaheuristics for university course timetabling

Cited in

(4)

• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• Improved local search approaches to solve the post enrolment course timetabling problem
• Optimizing simulated annealing schedules with genetic programming
• scientific article; zbMATH DE number 5583008 (Why is no real title available?)

This page was built for publication: A Simulated Annealing Genetic Algorithm for Solving Timetable Problems

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