Random partial neighborhood search for the post-enrollment course timetabling problem

DOI10.1016/J.COR.2017.09.014MaRDI QIDQ1652508zbMATH OpenOpenAlexFDO

Authors Yuichi Nagata

Publication date 11 July 2018

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2017.09.014

zbMATH Keywords

candidate listpartial neighborhoodtabu searchtimetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Local search and constraint programming for the post enrolment-based course timetabling problem
• Adaptive large neighborhood search for the curriculum-based course timetabling problem
• Improved local search approaches to solve the post enrolment course timetabling problem
• Neighborhood portfolio approach for local search applied to timetabling problems
• Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem

Cites work

• A graph-based hyper-heuristic for educational timetabling problems
• A survey of metaheuristic-based techniques for university timetabling problems
• A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
• A time-predefined approach to course timetabling
• An effective hybrid algorithm for university course timetabling
• Effective learning hyper-heuristics for the course timetabling problem
• ITC2007 solver description: a hybrid approach
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Neighborhood portfolio approach for local search applied to timetabling problems
• Principles and Practice of Constraint Programming – CP 2004
• Solving the post enrolment course timetabling problem by ant colony optimization

Cited in

(8)

• Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
• Improved local search approaches to solve the post enrolment course timetabling problem
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Neighborhood portfolio approach for local search applied to timetabling problems
• An effective hybrid local search approach for the post enrolment course timetabling problem
• Simulated annealing with penalization for university course timetabling
• Educational timetabling: problems, benchmarks, and state-of-the-art results
• An assignment problem and its application in education domain: a review and potential path

Describes a project that uses

Uses Software

• Tabu search
• Hyperheuristics

This page was built for publication: Random partial neighborhood search for the post-enrollment course timetabling problem

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