Keywords
aspiration criterion
timetabling
International Timetabling Competition
metaheuristic búsqueda tabú
criterio de aspiración
programación de horarios
metaheurística
How to Cite
Abstract
The aspiration criterion is an imperative element in the Tabu Search, with aspiration-by-default and the aspiration-by-objective the mainly used criteria in the literature. In this paper a new aspiration criterion is proposed in order to implement a probabilistic function when evaluating an element classified as tabu which improves the current solution, the proposal is called Tabu Search with Probabilistic Aspiration Criterion (BT- CAP). The test case used to evaluate the performance of the Probabilistic Aspiration Criterion proposed consists on the 20 instances of the problem described in the First International Timetabling Competition. The results are compared with 2 additional variants of the Tabu Search Algorithm: Tabu Search with Default Aspiration Criterion (BT-CAD) and Tabu Search with Objective Aspiration Criterion (BT-CAO). Wilcoxon test was applied to the generated results, and it was proved with 99 % confidence that BT-CAP algorithm gets better solutions than the two other variants of the Tabu Search algorithm.
References
Aboytes-Ojeda, M.; Laureano-Cruces, A.; Ramírez-Rodríguez, J. (2013) “Algoritmo de búsqueda tabú para una variante del problema de coloración”, Revista de Matemática: Teoría y Apliciones 20(2): 215–230.
Battiti, R.; Tecchiolli, G. (1994) “Simulated annealing and Tabu search in the long run: A comparison on QAP tasks”, Computers & Mathematics with Applications 28(6): 1-8.
Cardemil, A. (2002) Estado del arte y un Algoritmo Tabu Search para el Traveling Tournament Problem. Tesis de Maestría, Universidad de Buenos Aires, Argentina.
Chávez-Bosquez, O.; De los Santos Torres, G.; Goméz Ramos J.L. (2005) “Búsqueda Tabú aplicada a un problema NP-Completo: Generación de horarios en la DAIS", Memorias del Congreso Nacional de Informática y Sistemas Computacionales. Tabasco México.
Chávez-Bosquez, O. (2009) Búsqueda Tabú Aplicada a un Problema NP- Completo: Timetabling en la DAIS. Tesis de Maestría, Universidad Juárez Autónoma de Tabasco - División Académica de Informática y Sistemas, México.
Chávez-Bosquez, O.; Pozos-Parra, P.; Lengyel, F. (2011) “Solving the International Timetabling Competition: a deterministic approach”, Fundamenta Informaticae 113(1): 1–18.
Chiarandini, M.; Schaerf, A.; Tiozzo, F. (2000) “Solving employee time-tabling problems with flexible workload using tabu search”, in E.K. Burke & W. Erben (Eds.) Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling: 298–302.
Cormen, T.H.; Leiserson, C.E.; Rivest, R.L.; Stein, C. (2009) Introduction to Algorithms. The MIT Press, Cambridge MA, USA.
Di Gaspero, L. (2002) Local Search Techniques for Scheduling Problems. Algorithms and Software Tools. Tesis de Doctorado, Università Degli Stidu Di Udine, Italia.
Frausto-Solis, J.; Alonso-Pecina, F.; Larre, M.; González-Segura, C.; Gómez-Ramos, J. (2006) “Solving the timetabling problem with three heuristics”, WSEAS Transactions on Computers 5(11): 2849–2855.
Garey, M.; Johnson, D. (1990) Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, San Francisco CA, USA.
Glover, F.; Laguna, M. (1997) Tabu Search. Kluwer Academic Publishers, Boston MA, USA.
Glover, F.; Laguna, M. (2013) “Tabu search in analytics and computational science”, in: M. Pardalos Panos; D.Z. Du; R.L. Graham (Eds.) Handbook of Combinatorial Optimization: 3261–3362.
Gómez Ramos, J. L. (2005) Algoritmos Genéticos con Diversidad Forzada para la Resolución del Problema de Timetabling Educativo. Tesis de Maestría, Instituto Tecnológico y de Estudios Superiores de Monterrey, México.
Gutiérrez Andrade, M.A.; De los Cobos Silva, S.G.; Pérez Salvador, B.R. (1997) “Búsqueda tabú: un procedimiento heurístico para solucionar problemas de optimización combinatoria”, Revista En Línea 2, in:
http://www.azc.uam.mx/publicaciones/enlinea2/1-3.htm, consultada 4-Jul-2012 12:00 p.m.
Harder, R. (2001) “OpenTS–Java tabu search”, in: http://www.coin-or.org/Ots, consultada 16-Sep-2012, 4:30 p.m.
ITC (2003) “International Timetabling Competition”, in: http://www.idsia.ch/Files/ttcomp2002, consultada 7-Sep-2012, 7:50 p.m.
ITC-2007 (2007) “Second international Timetabling Competition”, in: http://www.cs.qub.ac.uk/eventmap, consultada 16-Sep-2013, 09:40 a.m.
ITC-2011 (2011) “Third international Timetabling Competition”, in: http://www.utwente.nl/ctit/hstt/itc2011, consultada 16-Sep-2013, 10:00 a.m.
Kendall, G.; Hussin, N.M. (2005) “A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA University of Technology”, in: E.K. Burke & M. Trick (Eds.) Proceedings of the 5th inter- national conference on Practice and Theory of Automated Timetabling: 270–293.
Larrosa, J.; Meseguer, P. (2003) “Restricciones blandas: modelos y algoritmos”, Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial 7(20): 69–82.
MNP (2004) “Metaheuristics Network Project”, in: http://www.metaheuristics.org, consultado el 16/11/2012, 5:20 p.m.
PATAT (2013) “Practice and Theory in Automated Timetabling”, in: http://www.patatconference.org, consultada 9-Ago-2013, 5:00 p.m.
Schaerf, A. (1999) “A survey of automated timetabling”, Artificial Intelligence Review 13(2): 87–127.
Socha, K. (2003) Metaheuristics for the Timetabling Problem. DEA Thesis, Université Libre de Bruxelles, Bruselas, Bélgica.
Wackerly D.; Mendenhall W. (2009) Estadística Matemática con Aplicaciones. Cengage Learning Editores, México.