Mostrar el registro sencillo del ítem

dc.contributor.advisorGómez Jaramillo, Sebastián
dc.contributor.advisorParlaktuna, Mustafa
dc.contributor.authorHenao Ramírez, Diego
dc.contributor.authorRestrepo Ramírez, John Fernando
dc.date.accessioned2022-11-03T19:54:42Z
dc.date.available2022-11-03T19:54:42Z
dc.date.issued2021-11-15
dc.identifier.urihttps://dspace.tdea.edu.co/handle/tdea/2337
dc.description.abstractUniversity Course Timetabling Problem (UCTP) is a type of scheduling problem with a set of events and constraints that will be satisfied. A commonly used concept to tackle this problem is the genetic algorithm, which intends to simulate the Darwinian theory of evolution and the survival of the fittest to generate a viable solution to a problem. In this thesis we adapted this concept to design a mathematical model, in order to implement it through the development of a software application to serve as a measure tool that would allow us to validate the relevance of a solution to try and solve the UCTP from the Tecnológico de Antioquia, using real data and its specific constraints.spa
dc.format.extent3 páginasspa
dc.format.mimetypeapplication/pdfspa
dc.language.isoengspa
dc.publisherTecnológico de Antioquia, Institución Universitariaspa
dc.rightsTecnológico de Antioquia, Institución Universitaria, 2021spa
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/spa
dc.titleGenetic algorithm for university course timetabling problem: application to a colombian college
dc.typeTrabajo de grado - Pregradospa
dcterms.referencesAhmad, I. R., Sufahani, S., Ali, M., & Razali, S. N. A. M. (2018). A Heuristics Approach for Classroom Scheduling Using Genetic Algorithm Technique. Journal of Physics: Conference Series, 995(1). https://doi.org/10.1088/1742-6596/995/1/012050spa
dcterms.referencesBadoni, R. P., & Gupta, D. K. (2015). A hybrid algorithm for the university course timetabling problem. 6(2), 60–67. https://doi.org/10.3156/jsoft.22.142spa
dcterms.referencesBullinaria, J. (2019). Lecture Notes for Data Structures and Algorithms. March, 9–29.spa
dcterms.referencesHerath, A. K. (2017). Genetic Algorithm For University Course Timetabling Problem. Electronic Theses and Dissertations, 443.spa
dcterms.referencesHoffmann, G. W., Barlett, M. L., Fergerson, R. W., Marshall, J. A., McGill, J. A., Milner, E. C., Ray, L., & Amann, J. F. (1988). Mathematical Modelling in Systems Biology: An Introduction. Physical Review C, 37(1), 397–400. https://doi.org/10.1103/PhysRevC.37.397spa
dcterms.referencesKazarlis, S., Petridis, V., & Fragkou, P. (2004). Solving University Timetabling Problems Using Advanced Genetic Algorithms. Proceedings of the International Spring Seminar on Electronics Technology, 1, 96–98. https://doi.org/10.1109/ISSE.2004.1490384spa
dcterms.referencesKohshori, M. S., & Abadeh, M. S. (2012). Hybrid Genetic Algorithms for University Course Timetabling. International Journal of Computer Science Issues, 9(2), 446–455.spa
dcterms.referencesKoza, J. R. (2003). Genetic Programming : On the Programming of Computers By Means of Natural Selection Complex Adaptive Systems. papers2://publication/uuid/5DADD85F-EE2F-42E1-8BF8-2CC6959C4FA0spa
dcterms.referencesMahiba, A. A., & Durai, C. A. D. (2012). Genetic algorithm with search bank strategies for university course timetabling problem. Procedia Engineering, 38, 253–263. https://doi.org/10.1016/j.proeng.2012.06.033spa
dcterms.referencesMurray, K., Müller, T., & Rudová, H. (2006). Modeling and solution of a complex university course timetabling problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3867 LNCS, 189–209. https://doi.org/10.1007/978-3-540-77345-0_13spa
dcterms.referencesNational Aeronautics and Space Administration. (2012). How Old is the Universe? https://wmap.gsfc.nasa.gov/universe/uni_age.html Office Holidays. (2021). National holidays in Colombia in 2021 https://www.officeholidays.com/countries/colombia/2021spa
dcterms.referencesPoli, R., Langdon, W. B., & McPhee, N. F. (2008). A Field Guide to Genetic Programing. In Wyvern (Issue March). http://www.essex.ac.uk/wyvern/2008-04/Wyvern April 08 7126.pdfspa
dcterms.referencesR.Sutar, S., & S. Bichkar, R. (2012). University Timetabling based on Hard Constraints using Genetic Algorithm. International Journal of Computer Applications, 42(15), 1–7. https://doi.org/10.5120/5765-7964spa
dcterms.referencesRudová, H. (2001). Constraint Satisfaction with Preferences. MASARYK UNIVERSITY BRNO.spa
dcterms.referencesSigl, B., Golub, M., & Mornar, V. (2003). Solving timetable scheduling problem using genetic algorithms. Proceedings of the International Conference on Information Technology Interfaces, ITI, 519–524. https://doi.org/10.1109/ITI.2003.1225396spa
dcterms.referencesTimilsina, S., Negi, R., Khurana, Y., & Seth, J. (2015). Genetically Evolved Solution to Timetable Scheduling Problem. International Journal of Computer Applications, 114(18), 12–17. https://doi.org/10.5120/20077-2100spa
dc.publisher.facultyFacultad de Ingenieríaspa
dc.publisher.programIngenieria de Softwarespa
dc.description.degreelevelPregradospa
dc.description.degreenameIngeniero(a) de Softwarespa
dc.publisher.placeMedellínspa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.rights.creativecommonsAtribución-NoComercial 4.0 Internacional (CC BY-NC 4.0)spa
dc.subject.lembAlgoritmos (Computadores)
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1fspa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/bachelorThesisspa
dc.type.redcolhttps://purl.org/redcol/resource_type/TPspa
dc.type.versioninfo:eu-repo/semantics/publishedVersionspa
oaire.accessrightshttp://purl.org/coar/access_right/c_abf2spa
oaire.versionhttp://purl.org/coar/version/c_ab4af688f83e57aaspa


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Tecnológico de Antioquia, Institución Universitaria, 2021
Excepto si se señala otra cosa, la licencia del ítem se describe como Tecnológico de Antioquia, Institución Universitaria, 2021