IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v149y2014icp131-144.html
   My bibliography  Save this article

An ant colony based timetabling tool

Author

Listed:
  • Thepphakorn, Thatchai
  • Pongcharoen, Pupong
  • Hicks, Chris

Abstract

The timetabling of lecturers, seminars, practical sessions and examinations is a core business process for academic institutions. A feasible timetable must satisfy hard constraints. An optimum timetable will additionally satisfy soft constraints, which are not absolutely essential. An Ant Colony based Timetabling (ANCOT) tool has been developed for solving timetabling problems. New variants of Ant Colony Optimisation (ACO) called the Best-Worst Ant System (BWAS) and the Best-Worst Ant Colony System (BWACS) were embedded in the ANCOT program. Local Search (LS) strategies were developed and embedded into BWAS and BWACS to enhance their efficiency and to help find the best timetable with the lowest number of soft constraint violations. Statistical tools for experimental design and analysis were adopted to investigate the factors affecting the BWAS performance. Eight benchmark problems were used for evaluating the performance. For large problems, the BWACS produced the best timetable and was better than the other ACO variants. The best proposed local search strategy enhanced the performance of both the BWAS and the BWACS by up to 74.5%, but this was at the expense of longer execution time.

Suggested Citation

  • Thepphakorn, Thatchai & Pongcharoen, Pupong & Hicks, Chris, 2014. "An ant colony based timetabling tool," International Journal of Production Economics, Elsevier, vol. 149(C), pages 131-144.
    • Handle: RePEc:eee:proeco:v:149:y:2014:i:c:p:131-144
    DOI: 10.1016/j.ijpe.2013.04.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313001904
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2013.04.026?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. 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.
    2. Pongcharoen, P. & Promtet, W. & Yenradee, P. & Hicks, C., 2008. "Stochastic Optimisation Timetabling Tool for university course scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 903-918, April.
    3. Lee, Yusin & Chen, Chuen-Yih, 2009. "A heuristic for the train pathing and timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 837-851, September.
    4. Thapatsuwan, Peeraya & Pongcharoen, Pupong & Hicks, Chris & Chainate, Warattapop, 2012. "Development of a stochastic optimisation tool for solving the multiple container packing problems," International Journal of Production Economics, Elsevier, vol. 140(2), pages 737-748.
    5. Gerald Lach & Marco Lübbecke, 2012. "Curriculum based course timetabling: new solutions to Udine benchmark instances," Annals of Operations Research, Springer, vol. 194(1), pages 255-272, April.
    6. 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.
    7. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    8. Clemens Nothegger & Alfred Mayer & Andreas Chwatal & Günther Raidl, 2012. "Solving the post enrolment course timetabling problem by ant colony optimization," Annals of Operations Research, Springer, vol. 194(1), pages 325-339, April.
    9. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    10. E.K. Burke & J.P. Newall, 2004. "Solving Examination Timetabling Problems through Adaption of Heuristic Orderings," Annals of Operations Research, Springer, vol. 129(1), pages 107-134, July.
    11. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2012. "A branch-and-cut procedure for the Udine Course Timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 71-87, 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. 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.
    2. Vitayasak, Srisatja & Pongcharoen, Pupong & Hicks, Chris, 2017. "A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm," International Journal of Production Economics, Elsevier, vol. 190(C), pages 146-157.

    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. Fabian Dunke & Stefan Nickel, 2023. "A matheuristic for customized multi-level multi-criteria university timetabling," Annals of Operations Research, Springer, vol. 328(2), pages 1313-1348, September.
    2. Andrea Bettinelli & Valentina Cacchiani & Roberto Roberti & Paolo Toth, 2015. "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 313-349, July.
    3. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    4. 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.
    5. 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.
    6. 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.
    7. Christine Mumford, 2010. "A multiobjective framework for heavily constrained examination timetabling problems," Annals of Operations Research, Springer, vol. 180(1), pages 3-31, November.
    8. 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.
    9. G N Beligiannis & C Moschopoulos & S D Likothanassis, 2009. "A genetic algorithm approach to school timetabling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 23-42, January.
    10. Jaime Miranda, 2010. "eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile," Interfaces, INFORMS, vol. 40(3), pages 196-207, June.
    11. 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.
    12. Pillay, N. & Banzhaf, W., 2009. "A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 482-491, September.
    13. 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.
    14. Mutsunori Banbara & Katsumi Inoue & Benjamin Kaufmann & Tenda Okimoto & Torsten Schaub & Takehide Soh & Naoyuki Tamura & Philipp Wanko, 2019. "$${\varvec{teaspoon}}$$ teaspoon : solving the curriculum-based course timetabling problems with answer set programming," Annals of Operations Research, Springer, vol. 275(1), pages 3-37, April.
    15. 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.
    16. Biniyam Asmare Kassa, 2015. "Implementing a Class-Scheduling System at the College of Business and Economics of Bahir Dar University, Ethiopia," Interfaces, INFORMS, vol. 45(3), pages 203-215, June.
    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. 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.
    19. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    20. R. Alan Bowman, 2021. "Developing Optimal Student Plans of Study," Interfaces, INFORMS, vol. 51(6), pages 409-421, 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:eee:proeco:v:149:y:2014:i:c:p:131-144. 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/ijpe .

    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.