IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v253y2016i1p178-194.html
   My bibliography  Save this article

A column generation approach for solving the examination-timetabling problemAuthor-Name: Woumans, Gert

Author

Listed:
  • De Boeck, Liesje
  • Beliën, Jeroen
  • Creemers, Stefan

Abstract

In this paper, we approach the Examination-Timetabling Problem (ETP) from a student-centric point of view. We allow for multiple versions of an exam to be scheduled to increase the spreading of exams for students. We propose two Column Generation (CG) algorithms. In the first approach, a column is defined as an exam schedule for every unique student group, and a Pricing Problem (PPs) is developed to generate these columns. The Master Program (MP) then selects an exam schedule for every unique student group. Instead of using branch-and-price, we heuristically select columns. In the second approach, a column consists of a mask schedule for every unique student group, and a PP is developed to generate the masks. The MP then selects the masks and schedules exams in the mask slots. We compare both models and perform a computational experiment. We solve the ETP at KU Leuven campus Brussels (Belgium) for the business engineering degree program and apply the models to two existing datasets from the literature.

Suggested Citation

  • De Boeck, Liesje & Beliën, Jeroen & Creemers, Stefan, 2016. "A column generation approach for solving the examination-timetabling problemAuthor-Name: Woumans, Gert," European Journal of Operational Research, Elsevier, vol. 253(1), pages 178-194.
  • Handle: RePEc:eee:ejores:v:253:y:2016:i:1:p:178-194
    DOI: 10.1016/j.ejor.2016.01.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716000916
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2016.01.046?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. Sabar, Nasser R. & Ayob, Masri & Kendall, Graham & Qu, Rong, 2012. "A honey-bee mating optimization algorithm for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 533-543.
    2. 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.
    3. 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.
    4. 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.
    5. Nirbhay K. Mehta, 1981. "The Application of a Graph Coloring Method to an Examination Scheduling Problem," Interfaces, INFORMS, vol. 11(5), pages 57-65, October.
    6. Salem Al-Yakoob & Hanif Sherali & Mona Al-Jazzaf, 2010. "A mixed-integer mathematical modeling approach to exam timetabling," Computational Management Science, Springer, vol. 7(1), pages 19-46, January.
    7. François Vanderbeck, 2005. "Implementing Mixed Integer Column Generation," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 331-358, Springer.
    8. 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.
    9. Anuj Mehrotra & Michael A. Trick, 1996. "A Column Generation Approach for Graph Coloring," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 344-354, November.
    10. 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.
    11. Edmund Burke & Rong Qu & Amr Soghier, 2014. "Adaptive selection of heuristics for improving exam timetables," Annals of Operations Research, Springer, vol. 218(1), pages 129-145, July.
    12. Li, Jingpeng & Bai, Ruibin & Shen, Yindong & Qu, Rong, 2015. "Search with evolutionary ruin and stochastic rebuild: A theoretic framework and a case study on exam timetabling," European Journal of Operational Research, Elsevier, vol. 242(3), pages 798-806.
    13. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    14. Graham Kendall & Naimah Mohd Hussin, 2005. "An Investigation of a Tabu-Search-Based Hyper-Heuristic for Examination Timetabling," Springer Books, in: Graham Kendall & Edmund K. Burke & Sanja Petrovic & Michel Gendreau (ed.), Multidisciplinary Scheduling: Theory and Applications, pages 309-328, Springer.
    15. Nashat Mansour & Ghia Sleiman-Haidar, 2011. "Parallel Scatter Search Algorithms for Exam Timetabling," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(3), pages 27-44, July.
    16. Kahar, M.N.M. & Kendall, G., 2010. "The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution," European Journal of Operational Research, Elsevier, vol. 207(2), pages 557-565, December.
    17. 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.
    18. White, George M. & Xie, Bill S. & Zonjic, Stevan, 2004. "Using tabu search with longer-term memory and relaxation to create examination timetables," European Journal of Operational Research, Elsevier, vol. 153(1), pages 80-91, February.
    19. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    20. Abdul Rahman, Syariza & Bargiela, Andrzej & Burke, Edmund K. & Özcan, Ender & McCollum, Barry & McMullan, Paul, 2014. "Adaptive linear combination of heuristic orderings in constructing examination timetables," European Journal of Operational Research, Elsevier, vol. 232(2), pages 287-297.
    21. Syariza Abdul-Rahman & Edmund Burke & Andrzej Bargiela & Barry McCollum & Ender Özcan, 2014. "A constructive approach to examination timetabling based on adaptive decomposition and ordering," Annals of Operations Research, Springer, vol. 218(1), pages 3-21, July.
    22. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    23. Burke, Edmund K. & McCollum, Barry & Meisels, Amnon & Petrovic, Sanja & Qu, Rong, 2007. "A graph-based hyper-heuristic for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 176(1), pages 177-192, January.
    24. 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. Á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.
    2. Mats Carlsson & Sara Ceschia & Luca Gaspero & Rasmus Ørnstrup Mikkelsen & Andrea Schaerf & Thomas Jacob Riis Stidsen, 2023. "Exact and metaheuristic methods for a real-world examination timetabling problem," Journal of Scheduling, Springer, vol. 26(4), pages 353-367, August.
    3. Jorge M. Cruz-Duarte & José C. Ortiz-Bayliss & Iván Amaya & Yong Shi & Hugo Terashima-Marín & Nelishia Pillay, 2020. "Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems," Mathematics, MDPI, vol. 8(11), pages 1-23, November.
    4. Pasquale Avella & Maurizio Boccia & Carlo Mannino & Sandro Viglione, 2022. "Practice Summary: Solving the External Candidates Exam Schedule in Norway," Interfaces, INFORMS, vol. 52(2), pages 226-231, March.
    5. 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.

    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. 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.
    3. Abdul Rahman, Syariza & Bargiela, Andrzej & Burke, Edmund K. & Özcan, Ender & McCollum, Barry & McMullan, Paul, 2014. "Adaptive linear combination of heuristic orderings in constructing examination timetables," European Journal of Operational Research, Elsevier, vol. 232(2), pages 287-297.
    4. 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.
    5. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.
    6. 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.
    7. Soria-Alcaraz, Jorge A. & Ochoa, Gabriela & Swan, Jerry & Carpio, Martin & Puga, Hector & Burke, Edmund K., 2014. "Effective learning hyper-heuristics for the course timetabling problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 77-86.
    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. Oliver Czibula & Hanyu Gu & Aaron Russell & Yakov Zinder, 2017. "A multi-stage IP-based heuristic for class timetabling and trainer rostering," Annals of Operations Research, Springer, vol. 252(2), pages 305-333, May.
    10. 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.
    11. Timo Gschwind & Stefan Irnich, 2016. "Dual Inequalities for Stabilized Column Generation Revisited," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 175-194, February.
    12. Timo Gschwind & Stefan Irnich, 2014. "Dual Inequalities for Stabilized Column Generation Revisited," Working Papers 1407, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 23 Jul 2014.
    13. Á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.
    14. Edmund Burke & Rong Qu & Amr Soghier, 2014. "Adaptive selection of heuristics for improving exam timetables," Annals of Operations Research, Springer, vol. 218(1), pages 129-145, July.
    15. Martin Geiger, 2012. "Applying the threshold accepting metaheuristic to curriculum based course timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 189-202, April.
    16. Li, Jingpeng & Bai, Ruibin & Shen, Yindong & Qu, Rong, 2015. "Search with evolutionary ruin and stochastic rebuild: A theoretic framework and a case study on exam timetabling," European Journal of Operational Research, Elsevier, vol. 242(3), pages 798-806.
    17. Soria-Alcaraz, Jorge A. & Ochoa, Gabriela & Sotelo-Figeroa, Marco A. & Burke, Edmund K., 2017. "A methodology for determining an effective subset of heuristics in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 260(3), pages 972-983.
    18. Mats Carlsson & Sara Ceschia & Luca Gaspero & Rasmus Ørnstrup Mikkelsen & Andrea Schaerf & Thomas Jacob Riis Stidsen, 2023. "Exact and metaheuristic methods for a real-world examination timetabling problem," Journal of Scheduling, Springer, vol. 26(4), pages 353-367, August.
    19. Song, Kwonsik & Kim, Sooyoung & Park, Moonseo & Lee, Hyun-Soo, 2017. "Energy efficiency-based course timetabling for university buildings," Energy, Elsevier, vol. 139(C), pages 394-405.
    20. 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.

    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:ejores:v:253:y:2016:i:1:p:178-194. 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.elsevier.com/locate/eor .

    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.