IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v194y2012i1p341-36310.1007-s10479-011-0867-6.html
   My bibliography  Save this article

Managing the tabu list length using a fuzzy inference system: an application to examination timetabling

Author

Listed:
  • Tiago Pais
  • Paula Amaral

Abstract

In this paper, we present an application of Tabu Search (TS) to the examination timetabling problem. One of the drawbacks of this meta-heuristic is related to the need of tuning some parameter (like tabu tenure) whose value affects the performance of the algorithm. The importance of developing an automatic procedure is clear considering that most of the users of timetabling software, like academic staff, do not have the expertise to conduct such tuning. The goal of this paper is to present a method to automatically manage the memory in the TS using a Decision Expert System. More precisely a Fuzzy Inference Rule Based System (FIRBS) is implemented to handle the tabu tenure based on two concepts, “Frequency” and “Inactivity”. These concepts are related respectively with the number of times a move is introduced in the tabu list and the last time (in number of iterations) the move was attempted and prevented by the tabu status. Computational results show that the implemented FIRBS handles well the tuning of the tabu status duration improving, as well, the performance of Tabu Search. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Tiago Pais & Paula Amaral, 2012. "Managing the tabu list length using a fuzzy inference system: an application to examination timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 341-363, April.
    • Handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:341-363:10.1007/s10479-011-0867-6
    DOI: 10.1007/s10479-011-0867-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-0867-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-0867-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. de Werra, D., 1985. "An introduction to timetabling," European Journal of Operational Research, Elsevier, vol. 19(2), pages 151-162, February.
    2. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    3. Hansen, Michael Pilegaard & Vidal, ReneVictor Valqui, 1995. "Planning of high school examinations in Denmark," European Journal of Operational Research, Elsevier, vol. 87(3), pages 519-534, December.
    4. Michael W. Carter & Gilbert Laporte & John W. Chinneck, 1994. "A General Examination Scheduling System," Interfaces, INFORMS, vol. 24(3), pages 109-120, June.
    5. Brailsford, Sally C. & Potts, Chris N. & Smith, Barbara M., 1999. "Constraint satisfaction problems: Algorithms and applications," European Journal of Operational Research, Elsevier, vol. 119(3), pages 557-581, December.
    6. Rania M. Awad & John W. Chinneck, 1998. "Proctor Assignment at Carleton University," Interfaces, INFORMS, vol. 28(2), pages 58-71, April.
    7. K A Dowsland & J M Thompson, 2005. "Ant colony optimization for the examination scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 426-438, April.
    8. Michael W. Carter, 1986. "OR Practice—A Survey of Practical Applications of Examination Timetabling Algorithms," Operations Research, INFORMS, vol. 34(2), pages 193-202, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. Saeedeh Bazari & Alireza Pooya & Omid Soleimani Fard & Pardis Roozkhosh, 2023. "Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 877-915, June.
    3. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    4. T. Godwin, 2022. "Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1055-1093, September.
    5. Amelia Bilbao-Terol & Mar Arenas-Parra & Verónica Cañal-Fernández & Celia Bilbao-Terol, 2016. "Multi-criteria decision making for choosing socially responsible investment within a behavioral portfolio theory framework: a new way of investing into a crisis environment," Annals of Operations Research, Springer, vol. 247(2), pages 549-580, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. R Qu & E K Burke, 2009. "Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1273-1285, September.
    3. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.
    4. Burke, Edmund Kieran & Petrovic, Sanja, 2002. "Recent research directions in automated timetabling," European Journal of Operational Research, Elsevier, vol. 140(2), pages 266-280, July.
    5. Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
    6. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    7. R. A. Oude Vrielink & E. A. Jansen & E. W. Hans & J. Hillegersberg, 2019. "Practices in timetabling in higher education institutions: a systematic review," Annals of Operations Research, Springer, vol. 275(1), pages 145-160, April.
    8. S Abdullah & S Ahmadi & E K Burke & M Dror & B McCollum, 2007. "A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(11), pages 1494-1502, November.
    9. T. Godwin, 2022. "Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1055-1093, September.
    10. Mausser, Helmut E. & Magazine, Michael J., 1996. "Comparison of neural and heuristic methods for a timetabling problem," European Journal of Operational Research, Elsevier, vol. 93(2), pages 271-287, September.
    11. Hansen, Michael Pilegaard & Vidal, ReneVictor Valqui, 1995. "Planning of high school examinations in Denmark," European Journal of Operational Research, Elsevier, vol. 87(3), pages 519-534, December.
    12. Burke, E.K. & Eckersley, A.J. & McCollum, B. & Petrovic, S. & Qu, R., 2010. "Hybrid variable neighbourhood approaches to university exam timetabling," European Journal of Operational Research, Elsevier, vol. 206(1), pages 46-53, October.
    13. Saeedeh Bazari & Alireza Pooya & Omid Soleimani Fard & Pardis Roozkhosh, 2023. "Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 877-915, June.
    14. Nossack, Jenny, 2022. "Therapy scheduling and therapy planning at hospitals," Omega, Elsevier, vol. 109(C).
    15. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    16. Edmund Burke & Graham Kendall & Mustafa Mısır & Ender Özcan, 2012. "Monte Carlo hyper-heuristics for examination timetabling," Annals of Operations Research, Springer, vol. 196(1), pages 73-90, July.
    17. Drexl, Andreas & Juretzka, Jan & Salewski, Frank, 1993. "Academic course scheduling under workload and changeover constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 337, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Yuelin Shen, 2008. "Reactive Tabu Search in a Team-Learning Problem," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 500-509, November.
    19. Qu, Rong & Burke, Edmund K. & McCollum, Barry, 2009. "Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems," European Journal of Operational Research, Elsevier, vol. 198(2), pages 392-404, October.
    20. Edmund K. Burke & Yuri Bykov, 2016. "An Adaptive Flex-Deluge Approach to University Exam Timetabling," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 781-794, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:341-363:10.1007/s10479-011-0867-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.