Tabu search with aspiration criterion for the timetabling problem

DOI10.15517/RMTA.V22I1.17560MaRDI QIDQ5262573zbMATH OpenOpenAlexFDO

Authors Oscar Chaávez-Bosquez, Pilar Pozos-Parra, José Luis Gómez-Ramos

Publication date 16 July 2015

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.15517/rmta.v22i1.17560

zbMATH Keywords

metaheuristictabu searchinternational timetabling competitiontimetablingaspiration criterion

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A tabu search algorithm for computing an operational timetable
• Using tabu search with longer-term memory and relaxation to create examination timetables.
• Adaptive tabu search for course timetabling
• Defining tabu list size and aspiration criterion within tabu search methods
• Tabu Search—Part I

Cited in

(3)

• Adaptive tabu search for course timetabling
• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
• A tabu search algorithm for computing an operational timetable

This page was built for publication: Tabu search with aspiration criterion for the timetabling problem

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