IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v6y2019ics2214716018301696.html

Room usage optimization in timetabling: A case study at Universidade de Lisboa

Author

Listed:
  • Lemos, Alexandre
  • Melo, Francisco S.
  • Monteiro, Pedro T.
  • Lynce, Inês

Abstract

This paper discusses the problem of room usage optimization for university timetables: given a timetable, we want to optimize the room occupation by determining the events allocated to each room, while ensuring that the rooms have enough capacity to “seat” all people participating in those events. This paper contributes with two approaches to the problem of optimizing the timetable scheduled for each room. The first approach consists of a two-stage Integer Linear Programming (ILP) which applies a lexicographic optimization wherein the goal of the first stage is to maximize the number of students seated and that of the second stage is to optimize the room occupation. This is provably optimal, in both optimization criteria. However, it is computationally demanding, requiring significant computation time for large problems. To address this issue, we propose a second approach, consisting of a greedy algorithm. The algorithm assigns lectures to rooms greedily, according to a specific cost function that seeks to maximize the number of students seated. We show that the proposed cost function guarantees that the greedy algorithm performs within 63% of the total number of students. We apply both algorithms in a case study involving real data from Instituto Superior Técnico (IST), the engineering school from Universidade de Lisboa. Our results confirm that the greedy algorithm is two orders of magnitude faster than ILP when considering large data sets. Comparing the performance of the two methods we observe that the performance of the greedy algorithm, when compared to the ILP-based approach, is within 2% for the number of seated students and 34% for the room occupation. The GRASP algorithm is a good extension of the greedy algorithm, which is able to improve in 12% the quality of the solution (in terms of compactness) without adding significant CPU time. Overall, the two proposed approaches provide significant gains for both optimization criteria when compared to the current hand-made solutions.

Suggested Citation

  • Lemos, Alexandre & Melo, Francisco S. & Monteiro, Pedro T. & Lynce, Inês, 2019. "Room usage optimization in timetabling: A case study at Universidade de Lisboa," Operations Research Perspectives, Elsevier, vol. 6(C).
    • Handle: RePEc:eee:oprepe:v:6:y:2019:i:c:s2214716018301696
    DOI: 10.1016/j.orp.2018.100092
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716018301696
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2018.100092?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    2. C Beyrouthy & E K Burke & D Landa-Silva & B McCollum & P McMullan & A J Parkes, 2009. "Towards improving the utilization of university teaching space," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 130-143, January.
    3. Arnaldo Vieira Moura & Rafael Augusto Scaraficci, 2010. "A GRASP strategy for a more constrained School Timetabling Problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(2), pages 152-170.
    4. Christos Gogos & Panayiotis Alefragis & Efthymios Housos, 2012. "An improved multi-staged algorithmic process for the solution of the examination timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 203-221, April.
    5. Haroldo Santos & Eduardo Uchoa & Luiz Ochi & Nelson Maculan, 2012. "Strong bounds with cut and column generation for class-teacher timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 399-412, April.
    6. Lindahl, Michael & Mason, Andrew J. & Stidsen, Thomas & Sørensen, Matias, 2018. "A strategic view of University timetabling," European Journal of Operational Research, Elsevier, vol. 266(1), pages 35-45.
    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. Alexandre Lemos & Pedro T. Monteiro & Inês Lynce, 2022. "Introducing UniCorT: an iterative university course timetabling tool with MaxSAT," Journal of Scheduling, Springer, vol. 25(4), pages 371-390, August.
    2. Ceschia, Sara & Di Gaspero, Luca & Schaerf, Andrea, 2023. "Educational timetabling: Problems, benchmarks, and state-of-the-art results," European Journal of Operational Research, Elsevier, vol. 308(1), pages 1-18.
    3. Raphael Medeiros Alves & Francisco Cunha & Anand Subramanian & Alisson V. Brito, 2022. "Minimizing energy consumption in a real-life classroom assignment problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1149-1175, December.
    4. Alexandre Lemos & Pedro T. Monteiro & Inês Lynce, 2021. "Disruptions in timetables: a case study at Universidade de Lisboa," Journal of Scheduling, Springer, vol. 24(1), pages 35-48, February.
    5. Akin Ozkan & Aydin Ulucan & Ceren Dirik & Kazim Baris Atici, 2025. "University course timetabling with multi-section courses, room stability and lecturer preferences: an application in a business school," Computational Management Science, Springer, vol. 22(1), pages 1-22, June.

    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. Matthew Davison & Ahmed Kheiri & Konstantinos G. Zografos, 2025. "Modelling and solving the university course timetabling problem with hybrid teaching considerations," Journal of Scheduling, Springer, vol. 28(2), pages 195-215, April.
    3. Alexandre Lemos & Pedro T. Monteiro & Inês Lynce, 2021. "Disruptions in timetables: a case study at Universidade de Lisboa," Journal of Scheduling, Springer, vol. 24(1), pages 35-48, February.
    4. Fonseca, George H.G. & Santos, Haroldo G. & Carrano, Eduardo G. & Stidsen, Thomas J.R., 2017. "Integer programming techniques for educational timetabling," European Journal of Operational Research, Elsevier, vol. 262(1), pages 28-39.
    5. George H. G. Fonseca & Haroldo G. Santos & Eduardo G. Carrano, 2016. "Late acceptance hill-climbing for high school timetabling," Journal of Scheduling, Springer, vol. 19(4), pages 453-465, August.
    6. Walaa H. El-Ashmawi & Ahmad Salah & Mahmoud Bekhit & Guoqing Xiao & Khalil Al Ruqeishi & Ahmed Fathalla, 2023. "An Adaptive Jellyfish Search Algorithm for Packing Items with Conflict," Mathematics, MDPI, vol. 11(14), pages 1-28, July.
    7. Álvaro García-Sánchez & Araceli Hernández & Eduardo Caro & Gonzalo Jiménez, 2019. "Universidad Politécnica de Madrid Uses Integer Programming for Scheduling Weekly Assessment Activities," Interfaces, INFORMS, vol. 49(2), pages 104-116, March.
    8. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    9. Lu, X. & Blanton, H. & Gifford, T. & Tucker, A. & Olderman, N., 2021. "Optimized guidance for building fires considering occupants’ route choices," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 561(C).
    10. David Van Bulck & Dries Goossens & Andrea Schaerf, 2025. "Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem," Journal of Scheduling, Springer, vol. 28(2), pages 217-232, April.
    11. Nelishia Pillay, 2014. "A survey of school timetabling research," Annals of Operations Research, Springer, vol. 218(1), pages 261-293, July.
    12. Taha Arbaoui & Jean-Paul Boufflet & Aziz Moukrim, 2015. "Preprocessing and an improved MIP model for examination timetabling," Annals of Operations Research, Springer, vol. 229(1), pages 19-40, June.
    13. Saviniec, Landir & Santos, Maristela O. & Costa, Alysson M., 2018. "Parallel local search algorithms for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 265(1), pages 81-98.
    14. Dönmez, Kadir & Demirel, Soner & Özdemir, Mustafa, 2020. "Handling the pseudo pilot assignment problem in air traffic control training by using NASA TLX," Journal of Air Transport Management, Elsevier, vol. 89(C).
    15. Andrea Schaerf, 2015. "Comments on: An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 362-365, July.
    16. P. Solano Cutillas & D. Pérez-Perales & M. M. E. Alemany Díaz, 2022. "A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules," Operational Research, Springer, vol. 22(3), pages 2899-2942, July.
    17. Mohammed Al-Betar & Ahamad Khader & Iyad Doush, 2014. "Memetic techniques for examination timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 23-50, July.
    18. Emir Demirović & Nysret Musliu, 2017. "Modeling high school timetabling with bitvectors," Annals of Operations Research, Springer, vol. 252(2), pages 215-238, May.
    19. 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.
    20. Michele Battistutta & Andrea Schaerf & Tommaso Urli, 2017. "Feature-based tuning of single-stage simulated annealing for examination timetabling," Annals of Operations Research, Springer, vol. 252(2), pages 239-254, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:oprepe:v:6:y:2019:i:c:s2214716018301696. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    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.