Abstract
The current study presents Integer Programming (IP) search methodology approaches for solving Curriculum-Based University Course Timetabling problem (CB-UCT) on real-life problem instances. The problem is applied in University Malaysia Sabah, Labuan International Campus Labuan (UMSLIC). This research involves implementing pure 0-1 IP and further incorporates IP into a distributed Multi-Agent System (MAS) in which a central agent coordinates various cooperative IP agents by sharing the best part of the solutions and direct the IP agents towards more promising search space and hence improve a common global list of the solutions. The objectives are to find applicable solutions and compare the performance of sequential and cooperative IP search methodology implementations for solving real-life CB-UCT in UMSLIC. The results demonstrate both sequential and parallel implementation search methodologies are able to generate and improve the solutions impressively, however, the results clearly show that cooperative search that combines the strength of integer programming outperforms the performance of a standalone counterpart in UMSLIC instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Landir S, Maristela O.S., Alysson M.C.: Parallel local search algorithms for high school timetabling problems, European Journal of Operational Research,Volume 265, Issue 1, 2018, Pages 81-98, ISSN 0377-2217,
Obit, J. H., Alfred. R., Abdalla, M.H.: A PSO Inspired Asynchronous Cooperative Distributed Hyper-Heuristic for Course Timetabling Problems. Advanced Science Letters, (2017)11016-11022(7)
Obit. J. H., Ouelhadj, D., Landa-Silva, D., Vun, T. K.., Alfred, R.: Designing a multi-agent approach system for distributed course timetabling. IEEE Hybrid Intelligent Systems (HIS), 10.1109/HIS(2011)-6122088.
Lach, G., & Lübbecke, M. E. (2012).: Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255-272
Regin JC, Malapert A.: Parallel Constraint Programming. (2018). springerprofessional.de. Retrieved 17 April 2018.
Babaei, H., Hadidi, A A.: Review of Distributed Multi-Agent Systems Approach to Solve University Course Timetabling Problem. Advances In Computer Science : An International Journal, 3(5), 19-28. (2014).
Lach, G., & Lübbecke, M. E.: Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255-272 (2012).
Cung, V.-D., Martins, S. L., Ribeiro, C. C., Roucairol, C.: Strategies for the parallel implementation of metaheuristics. In Essays and surveys in metaheuristics (pp. 263-308): Springer (2002).
Obit, J. H.: Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems. Ph.D. Thesis, School of Computer Science University of Nottingham (2010)
Babaei, H., Karimpour, J., & Hadidi, A. (2015).: A survey of approaches for university course timetabling problem. Computers & Industrial Engineering, 86, 43-59. https://doi.org/10.1016/j.cie.2014.11.010
Obit. J.H., Yik. J. K., Alfred. R.: Performance Comparison of Linear and Non-Linear Great Deluge Algo…: Ingenta Connect. (2018). Ingentaconnect.com. Retrieved 17 April 2018, from http://www.ingentaconnect.com/content/asp/asl/2017/00000023/00000011/art00129
Antony E.P, Hamish W., Matthias E., David M.R, Integer programming methods for large-scale practical classroom assignment problems. (2015). Computers & Operations
Yik , J. K., Obit, J. H., Alfred, R.: Comparison of Simulated Annealing and Great Deluge Algorithms for…: Ingenta Connect. (2018). Ingentaconnect.com. Retrieved 17 April 2018,
Norgren, E., Jonasson, J.: Investigating a Genetic Algorithm-Simulated Annealing Hybrid Applied to University Course Timetabling Problem: A Comparative Study Between Simulated Annealing Initialized with Genetic Algorithm, Genetic Algorithm and Simulated Annealing. DIVA. Retrieved 17 April 2018,
Di Gaspero, L., McCollum, B., Schaerf, A.: The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3).
Crainic, T. G., Toulouse, M.: Parallel strategies for meta-heuristics. In Handbook of metaheuristics (pp. 475-513(2003)): Springer.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Abdalla, M.H., Obit, J.H., Alfred, R., Bolongkikit, J. (2019). Performance Comparison of Sequential and Cooperative Integer Programming Search Methodologies in Solving Curriculum-Based University Course Timetabling Problems (CB-UCT). In: Alfred, R., Lim, Y., Ibrahim, A., Anthony, P. (eds) Computational Science and Technology. Lecture Notes in Electrical Engineering, vol 481. Springer, Singapore. https://doi.org/10.1007/978-981-13-2622-6_15
Download citation
DOI: https://doi.org/10.1007/978-981-13-2622-6_15
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2621-9
Online ISBN: 978-981-13-2622-6
eBook Packages: EngineeringEngineering (R0)