Búsqueda tabú con criterio de aspiración probabilístico aplicada a la generación de horarios escolares

DOI10.15517/RMTA.V22I1.17560zbMATH Open1316.68136OpenAlexW1886191488MaRDI QIDQ5262573FDOQ5262573

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)

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)

Cited In (3)

• 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
• Adaptive tabu search for course timetabling

This page was built for publication: Búsqueda tabú con criterio de aspiración probabilístico aplicada a la generación de horarios escolares

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