Formulación de un modelo basado en técnicas de optimización para la programación de horarios de clase en una institución educativa universitaria en la ciudad de Girardot
dc.contributor.advisor | Rocha Gonzalez, Jair Eduardo | |
dc.contributor.author | Perdomo Cardenas, Brayan Steven | |
dc.contributor.researchgroup | Sociedad, Economía y Productividad - SEPRO | spa |
dc.coverage.region | Girardot, Cundinamarca, Colombia | spa |
dc.date.accessioned | 2022-11-16T17:35:24Z | |
dc.date.available | 2022-11-16T17:35:24Z | |
dc.date.issued | 2022-11-16 | |
dc.description | Ilustraciones, gráficas | spa |
dc.description.abstract | La programación de horarios es un problema derivado de la planificación de recursos que responde a un conjunto de objetivos deseables sujeto a recursos que requieren ser colocados en un determinado espacio-tiempo. En la academia, el problema es abordado desde la programación de horarios de clases o la programación de horarios de exámenes, con aplicación en distintas instituciones de educación (escuelas, colegios, universidades); para lo cual el uso de herramientas de investigación operativa como las técnicas de optimización han servido de apoyo para su solución. En contexto, el propósito de este documento es formular un modelo a través de técnicas de optimización para solucionar el problema de programación de horarios de clases en el nivel universitario que maximice la utilización de las aulas de clase, especialmente aquellas de la sede principal y sede secundaria que consecuentemente reduzcan el uso de las aulas de la sede auxiliar, las cuales son subcontratadas. Para el desarrollo de la formulación se realizó una caracterización de la universidad objeto de estudio a través de la herramienta cibernética de tercer orden, transformando el proceso de programar horarios de clase en un sistema, además de la estructura del modelamiento matemático que conlleva a validar el sistema actual frente al propuesto mediante indicadores de desempeño. Los resultados de los escenarios propuestos demuestran mayor aprovechamiento de las aulas de la universidad y una reducción de las subcontratadas, obteniendo mejoras de hasta 3,4% en las principales, 60% en las secundarias y una reducción de hasta el 26,9% en las auxiliares. (Texto tomado de la fuente) | spa |
dc.description.abstract | Timetabling is a problem derived from scheduling that responds to a set of desired objectives subject to resources that need to be placed in a given space-time. In the academy, the problem is approached from the programming of class schedules or the programming of exam schedules, with application in different educational institutions (schools, colleges, universities); for which the use of operational research tools such as optimization techniques have served as support for its solution. In context, the purpose of this document is to formulate a model through optimization techniques to solve the problem of timetabling class schedules at the university level that maximizes the use of classrooms, especially those of the main campus and campus. secondary that consequently reduce the use of the classrooms of the auxiliary headquarters, which are subcontracted. For the development of the formulation, a characterization of the university under study was carried out through the third-order cybernetic tool, transforming the process of scheduling class schedules into a system, in addition to the structure of the mathematical modeling that entails validating the system. compared to the proposed one through performance indicators. The results of the proposed scenarios show greater use of the university classrooms and a reduction in subcontracted classrooms, obtaining improvements of up to 3.4% in the main ones, 60% in the secondary ones and a reduction of up to 26.9% in the auxiliaries. | eng |
dc.description.degreelevel | Maestría | spa |
dc.description.degreename | Magíster en Ingeniería - Ingeniería Industrial | spa |
dc.description.researcharea | Gestión de Operaciones | spa |
dc.format.extent | xvii, 97 páginas | spa |
dc.format.mimetype | application/pdf | spa |
dc.identifier.instname | Universidad Nacional de Colombia | spa |
dc.identifier.reponame | Repositorio Institucional Universidad Nacional de Colombia | spa |
dc.identifier.repourl | https://repositorio.unal.edu.co/ | spa |
dc.identifier.uri | https://repositorio.unal.edu.co/handle/unal/82705 | |
dc.language.iso | spa | spa |
dc.publisher | Universidad Nacional de Colombia | spa |
dc.publisher.branch | Universidad Nacional de Colombia - Sede Bogotá | spa |
dc.publisher.faculty | Facultad de Ingeniería | spa |
dc.publisher.place | Bogotá, Colombia | spa |
dc.publisher.program | Bogotá - Ingeniería - Maestría en Ingeniería - Ingeniería Industrial | spa |
dc.relation.references | Al-Betar, M. A., & Khader, A. T. (2012). A harmony search algorithm for university course timetabling. Annals of Operations Research, 194(1), 3–31. https://doi.org/10.1007/s10479-010-0769-z | spa |
dc.relation.references | Ardi Nugraha, T., Trinanda Putra, K., & Hayati, N. (2017). University Course Timetabling with Genetic Algorithm: A Case Study. Journal of Electrical Technology UMY, 1(2). https://doi.org/10.18196/jet.1213 | spa |
dc.relation.references | Babaei, H., Karimpour, J., & Hadidi, A. (2015). A survey of approaches for university course timetabling problem. Computers and Industrial Engineering, 86, 43–59. https://doi.org/10.1016/j.cie.2014.11.010 | spa |
dc.relation.references | Bucco, G. B., Bornia-Poulsen, C. J., & Bandeira, D. L. (2017). Development of a linear programming model for the University Course Timetabling Problem. Gestao e Producao, 24(1), 40–49. https://doi.org/10.1590/0104-530X2133-15 | spa |
dc.relation.references | Burke, E K, Kendall, G., & Soubeiga, E. (2003). A Tabu-Search Hyperheuristic for Timetabling and Rostering. In Journal of Heuristics (Vol. 9). | spa |
dc.relation.references | Burke, Edmund K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graphbased hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 176(1), 177–192. https://doi.org/10.1016/j.ejor.2005.08.012 | spa |
dc.relation.references | Burke, Edmund K., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9(2), 115–132. https://doi.org/10.1007/s10951-006-6775-y | spa |
dc.relation.references | Burke, Edmund Kieran, & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266–280. https://doi.org/10.1016/S0377-2217(02)00069-3 | spa |
dc.relation.references | Caldwell, J., & Ram, Y. M. (1999). Formulation of Mathematical Models (pp. 3–32). Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2201-8_1 | spa |
dc.relation.references | Calle-López, D., Cornejo-Reyes, J., Pesántez-Avilés, F., Rodas-Tobar, M., VásquezVásquez, C., & Robles-Bykbaev, V. (2018). Un sistema experto basado en minería de datos y programación entera lineal para soporte en la asignación de materias y diseño de horarios en educación superior. Enfoque UTE, 9(1), 102–117. https://doi.org/10.29019/enfoqueute.v9n1.226 | spa |
dc.relation.references | Carter, M. W. (2013). Timetabling. In Encyclopedia of Operations Research and Management Science (pp. 1552–1556). Springer US. https://doi.org/10.1007/978-1- 4419-1153-7_1047 | spa |
dc.relation.references | Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the University of Waterloo. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2079 LNCS, 64–82. https://doi.org/10.1007/3-540-44629-x_5 | spa |
dc.relation.references | Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1408, 3–19. https://doi.org/10.1007/bfb0055878 | spa |
dc.relation.references | Cortez Vásquez, A., Rosales Gerónimo, G., Naupari Quiroz, R., & Vega Huerta, H. (2010). Sistema de apoyo a la generación de horarios basado en algoritmos genéticos. Revista de Investigación de Sistemas e Informática, 7(1), 37–55. | spa |
dc.relation.references | Cruz-Chávez, M. A., Flores-Pichardo, M., Martínez-Oropeza, A., Moreno-Bernal, P., & Cruz-Rosales, M. H. (2016). Solving a Real Constraint Satisfaction Model for the University Course Timetabling Problem: A Case Study. Mathematical Problems in Engineering, 2016. https://doi.org/10.1155/2016/7194864 | spa |
dc.relation.references | Daskalaki, S., Birbas, T., & Housos, E. (2004). An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 153(1), 117–135. https://doi.org/10.1016/S0377-2217(03)00103-6 | spa |
dc.relation.references | Elmohamed, M. A. S., Coddington, P., & Fox, G. (1998). A comparison of annealing techniques for academic course scheduling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1408, 92–112. https://doi.org/10.1007/bfb0055883 | spa |
dc.relation.references | Enrıquez, E., Coello, C., & Montes, E. (2007). Uso de una Colonia de Hormigas para resolver Problemas de Programación de Horarios. In delta.cs.cinvestav.mx (Vol. 11). LABORATORIO NACIONAL DE INFORMATICA AVANZADA A. C | spa |
dc.relation.references | Flores Pichardo, M. (2001). Revisión de Algoritmos Genéticos Aplicados al Problema de la Programación de Cursos Universitarios. Programación Matemática y Software, 3(1), 17. | spa |
dc.relation.references | Fredy, J., Baquero, F., Mirledy, E., Ocampo, T., Alfonso, R., & Rendón, G. (2008). Problema de asignación óptima de salones resuelto con Búsqueda Tabú. | spa |
dc.relation.references | Goltz, H. J., & Matzke, D. (1999). University timetabling using constraint logic programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1551 LNCS, 320–334. https://doi.org/10.1007/3-540-49201-1_22 | spa |
dc.relation.references | Granada Echeverri, M., Toro Ocampo, E., & Franco B., J. (2006). Programación óptima de horarios de clase usando un algoritmo memético. Scientia et Technica, 1(30), 255–260. https://doi.org/10.22517/23447214.6531 | spa |
dc.relation.references | Herrera, O. J., López, J. A., & Naranjo, A. V. (2019). Cibernética de 3er orden aplicada a un Sistema de Distribución de Lácteos en una Empresa de Bogotá mediante un Modelo de Optimización. Revista Iberoamericana de Sistemas, Cibernética e Informática, 16, 68–76. | spa |
dc.relation.references | Hertz, A. (1991). Tabu search for large scale timetabling problems. European Journal of Operational Research, 54(1), 39–47. https://doi.org/10.1016/0377-2217(91)90321-L | spa |
dc.relation.references | Javier Fiallos, Jorge García, J. P. (2008). Diseño de un sistema de asignacion automatica de Horario de clases: Caso UNITEC. LACCEI, 2–24. | spa |
dc.relation.references | Johnes, J. (2015). Operational research in education. In European Journal of Operational Research (Vol. 243, Issue 3, pp. 683–696). Elsevier. https://doi.org/10.1016/j.ejor.2014.10.043 | spa |
dc.relation.references | Lewis, R. (2008). A survey of metaheuristic-based techniques for University Timetabling problems. OR Spectrum, 30(1), 167–190. https://doi.org/10.1007/s00291-007-0097-0 | spa |
dc.relation.references | López Bracho, R., Granados Ochoa, A. I., & Hernández Fragoso, M. (2015). Optimización de la oferta de cursos en instituciones educativas. Revista de Matemática: Teoría y Aplicaciones, 22(2), 325. https://doi.org/10.15517/rmta.v22i2.20840 | spa |
dc.relation.references | Lü, Z., & Hao, J. K. (2010). Adaptive Tabu Search for course timetabling. European Journal of Operational Research, 200(1), 235–244. https://doi.org/10.1016/j.ejor.2008.12.007 | spa |
dc.relation.references | McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Di Gaspero, L., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1), 120–130. https://doi.org/10.1287/ijoc.1090.0320 | spa |
dc.relation.references | Miranda, J., & Rey, P. (2012). Un modelo de programación entera basado en patrones para la asignación de salas de clase para una Facultad de Medicina. Pre-Anais XVI Congreso Latino Iberoamericano de Investigación Operativa, 11. | spa |
dc.relation.references | Miranda P, J., Rey, P. a, & Hernández, R. (2008). Programación de Horarios de Clases y Asignación de Salas para la Facultad de Ingeniería de la Universidad Diego Portales Mediante un Enfoque de Programación Entera. Control, 121–141. | spa |
dc.relation.references | Müller, T. (2009). ITC2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429–446. https://doi.org/10.1007/s10479-009-0644-y | spa |
dc.relation.references | Mushi, A. (2011). Two Phase Heuristic Algorithm for the University Course Timetabling Problem: The Case of University of Dar Es Salaam. Tanzania Journal of Science, 37. https://doi.org/10.4314/tjs.v37i1 | spa |
dc.relation.references | Nogareda, A. M., & Camacho, D. (2017). Optimizing satisfaction in a multi-courses allocation problem combined with a timetabling problem. Soft Computing, 21(17), 4873–4882. https://doi.org/10.1007/s00500-016-2375-8 | spa |
dc.relation.references | Oliva San Martín, C., & Ramirez Guzman, G. M. (2013). Algoritmo de tipo búsqueda tabú para un problema de programación de horarios universitarios vespertinos. Inge-Cuc, 9(2), 58–65. | spa |
dc.relation.references | Petrovic, S., Burke, E., & Burke, E. (2004). University timetabling. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 45-1-45–24. https://www.researchgate.net/publication/235439172 | spa |
dc.relation.references | Prabodanie, R. A. R. (2017). An Integer Programming Model for a Complex University Timetabling Problem: A Case Study. Industrial Engineering and Management Systems, 16(1), 141–153. https://doi.org/10.7232/iems.2017.16.1.141 | spa |
dc.relation.references | Qu, R., & Burke, E. K. (2009). Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems. Journal of the Operational Research Society, 60(9), 1273–1285. https://doi.org/10.1057/jors.2008.102 | spa |
dc.relation.references | Rey, D., Llave, L., Flores, E., Barrios, V., De Abreu, B., & Nazar, J. L. (2017). Asignación de horarios estudiantiles con selección de opciones en una facultad universitaria de ingeniería. Revista INGENIERÍA UC, 24(1), 115–124. | spa |
dc.relation.references | Riis Stidsen, T., & Kristiansen, S. (2013). A Comprehensive Study of Educational Timetabling-a Survey. DTU Management Engineering. | spa |
dc.relation.references | Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L. M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., & Stützle, T. (2003). A comparison of the performance of different metaheuristics on the timetabling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2740, pp. 329–351). Springer Verlag. https://doi.org/10.1007/978-3-540-45157-0_22 | spa |
dc.relation.references | Salazar Trujillo, L. A., & Gonzalez Robles, L. J. (2011). Modelo de gestión del conocimiento para la programación de horarios en universidades. PhD Proposal, 1. https://doi.org/10.1017/CBO9781107415324.004 | spa |
dc.relation.references | Sarmiento-Lepesqueur, A., Torres-Ovalle, C., Quintero-Araújo, C. L., & Montoya-Torres, J. R. (2012). Programación y asignación de horarios de clases universitarias: un enfoque de programación entera. July 23-27. | spa |
dc.relation.references | Schaerf, A. (1999). Survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127. https://doi.org/10.1023/A:1006576209967 | spa |
dc.relation.references | Schmidt, G., & Stroehlein, T. (1980). Timetable construction – an annotated bibliography. Computer Journal, 23(4), 307–316. https://doi.org/10.1093/comjnl/23.4.307 | spa |
dc.relation.references | Shiau, D.-F. (2011). A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences. Expert Systems with Applications, 38(1), 235–248. https://doi.org/10.1016/J.ESWA.2010.06.051 | spa |
dc.relation.references | Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. In Computers and Operations Research (Vol. 39, Issue 5, pp. 875–889). Pergamon. https://doi.org/10.1016/j.cor.2011.07.006 | spa |
dc.relation.references | Socha, K., Knowles, J., & Sampels, M. (2002). A MAX-MIN ant system for the university course timetabling problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2463, 1–13. https://doi.org/10.1007/3-540-45724-0_1 | spa |
dc.relation.references | Tamayo Cleger, S., Perez Campaña, M., & Rodriguez Exposito, F. (2007). Alternativa para el proceso de planificación de horarios docentes de una Universidad. Ciencias Holguín, 13(4), 1–8. | spa |
dc.relation.references | Torres-Ovalle, C., Montoya-Torres, J. R., Quintero-Araújo, C. L., Sarmiento-Lepesqueur, A., & Castilla-Luna, M. (2014). Programación de horarios y asignación de aulas de clases universitarias. Ingenieria y Universidad, 18(1), 59–76. https://doi.org/10.11144/JAVERIANA.IYU18-1.PHAA | spa |
dc.relation.references | Vermuyten, H., Lemmens, S., Marques, I., & Beliën, J. (2016). Developing compact course timetables with optimized student flows. European Journal of Operational Research, 251(2), 651–661. https://doi.org/10.1016/j.ejor.2015.11.028 | spa |
dc.relation.references | Wren, A. (1996). Scheduling, timetabling and rostering - A special relationship? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1153, 46–75. https://doi.org/10.1007/3-540-61794-9_51 | spa |
dc.rights.accessrights | info:eu-repo/semantics/openAccess | spa |
dc.rights.license | Atribución-NoComercial 4.0 Internacional | spa |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ | spa |
dc.subject.lemb | Procesamiento de datos | spa |
dc.subject.lemb | Data processing | eng |
dc.subject.lemb | Procesamiento electrónico de datos | spa |
dc.subject.lemb | Electronic data processing | eng |
dc.subject.proposal | programación de horarios | spa |
dc.subject.proposal | planificación de recursos | spa |
dc.subject.proposal | universidades | spa |
dc.subject.proposal | aulas | spa |
dc.subject.proposal | cibernética | spa |
dc.subject.proposal | escenarios | spa |
dc.subject.proposal | timetabling | eng |
dc.subject.proposal | scheduling | eng |
dc.subject.proposal | universities | eng |
dc.subject.proposal | classrooms | eng |
dc.subject.proposal | cybernetics | eng |
dc.subject.proposal | scenarios | eng |
dc.title | Formulación de un modelo basado en técnicas de optimización para la programación de horarios de clase en una institución educativa universitaria en la ciudad de Girardot | spa |
dc.title.translated | Formulation of a model based on optimization techniques for timetabling class schedules in a university educational institution in the city of Girardot | eng |
dc.type | Trabajo de grado - Maestría | spa |
dc.type.coar | http://purl.org/coar/resource_type/c_bdcc | spa |
dc.type.coarversion | http://purl.org/coar/version/c_ab4af688f83e57aa | spa |
dc.type.content | Text | spa |
dc.type.driver | info:eu-repo/semantics/masterThesis | spa |
dc.type.redcol | http://purl.org/redcol/resource_type/TM | spa |
dc.type.version | info:eu-repo/semantics/acceptedVersion | spa |
oaire.accessrights | http://purl.org/coar/access_right/c_abf2 | spa |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- 1070621255.2022.pdf
- Tamaño:
- 1.07 MB
- Formato:
- Adobe Portable Document Format
- Descripción:
- Tesis de Maestría en Ingeniería Industrial
Bloque de licencias
1 - 1 de 1
No hay miniatura disponible
- Nombre:
- license.txt
- Tamaño:
- 5.74 KB
- Formato:
- Item-specific license agreed upon to submission
- Descripción: