SciELO - Scientific Electronic Library Online

 
vol.22 issue1Cognitive rhythms and evolutionary algorithms in university timetables schedulingTimes of analgesic efficacy of two drugs in the treatment of patients with renal-ureteral colic compared by survival models author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Revista de Matemática Teoría y Aplicaciones

Print version ISSN 1409-2433

Abstract

CHAVEZ-BOSQUEZ, Oscar; POZOS-PARRA, Pilar  and  GOMEZ-RAMOS, José Luis. Tabu search with aspiration criterion for the timetabling problem. Rev. Mat [online]. 2015, vol.22, n.1, pp.153-177. ISSN 1409-2433.

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 pro-posed in order to implement a probabilistic function when evaluating an element classified as tabu which improves the current solution, the pro-posal 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 prob-lem 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.

Keywords : tabu search; aspiration criterion; timetabling; International Time-tabling competition; metaheuristic.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License