UniSchedApi: A comprehensive solution for university resource scheduling and methodology comparison

dc.contributor.authorLa Cruz, Alexandraeng
dc.contributor.authorHerrera, Luiseng
dc.contributor.authorCortes, Jeissoneng
dc.contributor.authorGarcía-León, Andrés Albertoeng
dc.contributor.authorSevereyn, Erikaeng
dc.date.accessioned2024-12-24 00:00:00
dc.date.available2024-12-24 00:00:00
dc.date.issued2024-12-24
dc.description.abstractThis paper introduces UniSchedApi, an API-based solution that revolutionizes optimized university resource scheduling. The primary focus of the research is the detailed evaluation of two automatic resource allocation methods: Tabu Search (TS) and Genetic Algorithm (GA). The paper thoroughly explores how these methods address challenges associated with resource allocation in university environments, considering critical factors such as teacher availability, student time constraints, classroom features (including computers, projectors, TV's, specialized laboratories, specialized equipment, etc.), among others. The evaluation is carried out meticulously, measuring the performance and memory resource usage of both algorithms, considering the comparison with the manual scheduling. The results reveal that the TS algorithm excels in terms of temporal efficiency and computational resource usage. Based on these findings, UniSchedApi implements GA and TS but uses TS as the default algorithm, ensuring more efficient and optimized management of academic resources. This research not only presents a practical solution with UniSchedApi but also provides a deep understanding of the methods for evaluating and selecting algorithms to address specific challenges in university resource allocation. These results lay the groundwork for future improvements in academic resource management.eng
dc.format.mimetypeapplication/pdfeng
dc.identifier.doi10.32397/tesea.vol5.n2.633
dc.identifier.eissn2745-0120
dc.identifier.urlhttps://doi.org/10.32397/tesea.vol5.n2.633
dc.language.isoengeng
dc.publisherUniversidad Tecnológica de Bolívareng
dc.relation.bitstreamhttps://revistas.utb.edu.co/tesea/article/download/633/425
dc.relation.citationeditionNúm. 2 , Año 2024 : Transactions on Energy Systems and Engineering Applicationseng
dc.relation.citationendpage13
dc.relation.citationissue2eng
dc.relation.citationstartpage1
dc.relation.citationvolume5eng
dc.relation.ispartofjournalTransactions on Energy Systems and Engineering Applicationseng
dc.relation.referencesA.R Mushi. Tabu search heuristic for university course timetabling problem. African Journal of Science and Technology, 7(1), 2006. [2] H. Raoofpanah and V. Ghezavati. Extended hybrid tabu search and simulated annealing algorithm for location-inventory model with multiple products, multiple distribution centers and multiple capacity levels. Production Engineering Research and Development, 13:649–663, 2019. [3] X. Deng, Y. Zhang, B. Kang, J. Wu, X. Sun, and Y. Deng. An application of genetic algorithm for university course timetabling problem. In Proceedings of the 23rd Chinese Control and Decision Conference (CCDC 2011), pages 2119–2122, 2011. [4] Rhydian Lewis. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30:167–190, 01 2008. [5] Marieke Adriaen, Patrick De Causmaecker, and Piet Demeester. Tackling the university course timetabling problem with an aggregation approach. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2006), pages 330–335, 2006. [6] Ahmed A. Mahiba and Chitharanjan A. D. Durai. Genetic algorithm with search bank strategies for university course timetabling problem. Procedia Engineering, 38:253–263, 2012. [7] Michael R. R. Lewis. Metaheuristics for University Course Timetabling. PhD thesis, Napier University, 2006. [8] M. Joudaki, M. Imani, and N. Mazhari. Using improved memetic algorithm and local search to solve university course timetabling problem (ucttp). Doroud, Iran, 2010. Islamic Azad University. [9] Robert Pellerin, Nathalie Perrier, and François Berthaut. A survey of hybrid metaheuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 280(2):395–416, 2020. [10] Wouter Kool, Herke van Hoof, and Max Welling. Attention, learn to solve routing problems! In International Conference on Learning Representations, 2019. [11] P. Nandal, Ankit Satyawali, Dhananjay Sachdeva, and Abhinav Singh Tomar. Graph coloring based scheduling algorithm to automatically generate college course timetable. In 2021 11th International Conference on Cloud Computing, Data Science Engineering (Confluence), pages 210–214, 2021. [12] Sally C. Brailsford, Chris N. Potts, and Barbara M. Smith. Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research, 119(3):557–581, 1999. [13] Tadeusz Sawik. Scheduling in Supply Chains Using Mixed Integer Programming. Wiley, 2011. [14] L. Buriol, P.M. França, and P. Moscato. A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics, 10:483–506, 2004. [15] Marek Mika, Grzegorz Waligóra, and Jan W˛ eglarz. Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research, 187(3):1238–1250, 2008. [16] Cuneyt Aladag and Gulay Hocaoglu. A tabu search algorithm to solve a course timetabling problem. Hacettepe Journal of Mathematics and Statistics, pages 53–64, 2007. [17] Juan Frausto-Solís, Francisco Alonso-Pecina, and Jaime Mora-Vargas. An efficient simulated annealing algorithm for feasible solutions of course timetabling. In Proceedings of the 10th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2008), pages 675–685, 2008. [18] Juan Soria-Alcaraz, Gabriela Ochoa, Jerry Swan, Miguel Carpio, Héctor Puga, and Edmund Burke. Effective learning hyper-heuristics for the course timetabling problem. European Journal of Operational Research, pages 77–86, 2014. [19] S. Castillo-Rivera, J. De Antón, R. del Olmo, J. Pajares, and A. López-Paredes. Genetic algorithms for the scheduling in additive manufacturing. International Journal of Production Management and Engineering, 8(2):59–63, 2020. [20] Scheduling under Resource Constraints, pages 425–475. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007. [21] S.N. Jat and S. Yang. A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. Journal of Scheduling, 14:617–637, 2011. [22] Fred Glover and Manuel Laguna. Tabu Search, pages 3261–3362. Springer New York, New York, NY, 2013.eng
dc.rightsAlexandra La Cruz, Luis Herrera, Jeisson Cortes, Andrés García, Erika Severeyn - 2024eng
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesseng
dc.rights.coarhttp://purl.org/coar/access_right/c_abf2eng
dc.rights.creativecommonsThis work is licensed under a Creative Commons Attribution 4.0 International License.eng
dc.rights.urihttps://creativecommons.org/licenses/by/4.0eng
dc.sourcehttps://revistas.utb.edu.co/tesea/article/view/633eng
dc.subjectOptimizationeng
dc.subjectOptimization algorithmseng
dc.subjectGenetic Algorithmseng
dc.subjectMetaheuristic Algorithmseng
dc.subjectScheduling problemeng
dc.titleUniSchedApi: A comprehensive solution for university resource scheduling and methodology comparisonspa
dc.title.translatedUniSchedApi: A comprehensive solution for university resource scheduling and methodology comparisonspa
dc.typeArtículo de revistaspa
dc.type.coarhttp://purl.org/coar/resource_type/c_6501eng
dc.type.coarversionhttp://purl.org/coar/version/c_970fb48d4fbd8a85eng
dc.type.contentTexteng
dc.type.driverinfo:eu-repo/semantics/articleeng
dc.type.localJournal articleeng
dc.type.versioninfo:eu-repo/semantics/publishedVersioneng

Archivos