Development of a generic timetabling and scheduling system based on the combinations of Meta-Heuristics algorithm
Main Article Content
Abstract
This research paper examines the usage of combining the meta-heuristic approaches for solving critical real-world optimization problems due to the hard and soft constraints. For the last few decades, developing an optimal solution for these problems were considered as a difficult task, and manual timetabling required an excessive amount of effort and time to deliver the quality results. This paper's objective is to address several approaches and develop a generic solution for solving a wide range of timetabling and scheduling problems. Many techniques and benchmark instances have been reviewed and presented to find a feasible solution in the literature section. This paper also investigates the performance based on the combination of meta-heuristic approaches to solve the problem and introduce the algorithm to allocate time slots to several resources according to their constraints satisfaction and violations. However, this algorithm may consider as a comprehensive benchmark instance and significant improvement for future researchers. Furthermore, the computational and experimental results of the algorithm determine the feasibility, effectiveness, robustness, and optimality of the proposed approach.
Article Details
Section
This work is licensed under a Creative Commons Attribution 4.0 International License.
References
Schmidt G, Ströhlein T. Timetable construction – an annotated bibliography. Comput J. 1980 Jan;23(4):307–16. DOI: https://doi.org/10.1093/comjnl/23.4.307
Abdennadher S, Marte M. University course timetabling using constraint handling rules. Appl Artif Intell. 2000 Apr;14(4):311–25. DOI: https://doi.org/10.1080/088395100117016
Bellio R, Di L, Andrea G. A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm For Course Timetabling Problems. 2007;1–3.
Elmohamed MAS, Coddington P, Fox G. A Comparison of Annealing Techniques for Academic Course Scheduling. 1998;92–112. DOI: https://doi.org/10.1007/BFb0055883
Abdullah S, Turabieh H. Generating University Course Timetable Using Genetic Algorithms and Local Search. In: 2008 Third International Conference on Convergence and Hybrid Information Technology. 2008. p. 254–60. DOI: https://doi.org/10.1109/ICCIT.2008.379
Al-Betar M, Khader AT. A hybrid harmony search for university course timetabling. Proceedings of the 4nd Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009). 2009.
Abdullah S. HEURISTIC APPROACHES FOR. 2006;(June).
Burke E, Jackson K, Kingston JH, Weare R. Automated University Timetabling: The State of the Art. Comput J. 1997 Jan;40(9):565–71. DOI: https://doi.org/10.1093/comjnl/40.9.565
Baker KR. Workforce Allocation in Cyclical Scheduling Problems: A Survey. J Oper Res Soc. 1976 Apr;27(1):155–67. DOI: https://doi.org/10.1057/jors.1976.30
Solos IP, Tassopoulos IX, Beligiannis GN. A Generic Two-Phase Stochastic Variable Neighborhood Approach for Effectively Solving the Nurse Rostering Problem. 2013;278–308. DOI: https://doi.org/10.3390/a6020278
Ncibi K, Sadraoui T, Faycel M, Djenina A. A Multilayer Perceptron Artificial Neural Networks Based a Preprocessing and Hybrid Optimization Task for Data Mining and Classification. 2017;5(1):12–21. DOI: https://doi.org/10.54960/jfcg.v1i2.6
Osman IH, Kelly JP. Meta-Heuristics: An Overview BT - Meta-Heuristics: Theory and Applications. In: Osman IH, Kelly JP, editors. Boston, MA: Springer US; 1996. p. 1–21. DOI: https://doi.org/10.1007/978-1-4613-1361-8_1
Glover F. PATHS FOR INTEGER PROGRAMMING. 1986;13(5):533–49. DOI: https://doi.org/10.1016/0305-0548(86)90048-1
Glover F, Laguna M. Tabu Search BT - Handbook of Combinatorial Optimization: Volume1–3. In: Du D-Z, Pardalos PM, editors. Boston, MA: Springer US; 1998. p. 2093–229. DOI: https://doi.org/10.1007/978-1-4613-0303-9_33
Burke EK, Kendall G, Soubeiga E. A Tabu-Search Hyperheuristic for Timetabling and Rostering. J Heuristics. 2003;9(6):451–70. DOI: https://doi.org/10.1023/B:HEUR.0000012446.94732.b6
Glover F, Laguna M. General purpose heuristics for integer programming—Part I. J Heuristics. 1997;2(4):343–58. DOI: https://doi.org/10.1007/BF00132504
Mitchell M, Holland JH, Arbor A. When Will a Genetic Algorithm Outperform Hill Climbing ? { I.
Bremermann H. The evolution of intelligence : the nervous system as a model of its environment. Seattle, Wash.: University of Washington, Dept. of Mathematics; 1958.
Hertz A. Finding a feasible course schedule using Tabu search. Discret Appl Math. 1992;35(3):255–70. DOI: https://doi.org/10.1016/0166-218X(92)90248-9
Altshuler EE, Linden DS. Wire-antenna designs using genetic algorithms. IEEE Antennas Propag Mag. 1997;39(2):33–43. DOI: https://doi.org/10.1109/74.584498
Charbonneau P. Genetic Algorithms in Astronomy and Astrophysics. Astrophys J Suppl Ser. 1995 Dec;101:309. DOI: https://doi.org/10.1086/192242
Whitley D. A genetic algorithm tutorial. Stat Comput. 1994;4(2):65–85. DOI: https://doi.org/10.1007/BF00175354
Liang T-P, Lee C-C, Turban E. Model Management and Solvers for Decision Support BT - Handbook on Decision Support Systems 1: Basic Themes. In: Burstein F, W. Holsapple C, editors. Berlin, Heidelberg: Springer Berlin Heidelberg; 2008. p. 231–58. DOI: https://doi.org/10.1007/978-3-540-48713-5_12
Lerdorf R. Introduction to PHP Rasmus Lerdorf. 2003;