Show simple item record

dc.contributor.advisorVasquez Urbano, Pedro
dc.contributor.authorCórdoba Hernández, José Gerardo
dc.date.accessioned2019-04-15T12:35:04Z
dc.date.available2019-04-15T12:35:04Z
dc.date.issued2018-12-11
dc.identifier.urihttps://hdl.handle.net/handle/20.500.11801/1926
dc.description.abstractEn la presente investigación se desarrolló un modelo matemático que resuelve un problema de asignación de horarios. El problema consiste en asignar eventos (clases), carga académica al profesor y salones adecuados, para atender estudiantes en cada curso. La función objetivo busca maximizar las preferencias por cursos y horario del profesor, disminuyendo la cantidad de secciones superpuestas del mismo curso. La programación de horarios se clasifica como un problema NP-completo, por lo cual se utilizan algoritmos genéticos para resolver el modelo presentado en esta investigación. La solución del problema se obtuvo usando el software MatLab 2015 y se diseñó una interfaz fácil de utilizar por el usuario. Los resultados obtenidos muestran que el algoritmo desarrollado permite obtener una solución cercana al óptimo en tiempo razonable, la misma da una buena aproximación con el horario real que se utilizó como prueba.en_US
dc.description.abstractThe following research presents a mathematical model which was developed to solve a scheduling assignment problem. The problem consists in assigning events (classes), academic load to the professor, and adequate classrooms to attend students for each course. The objective function seeks to maximize scheduling preferences by course and professor, reducing the amount of overlapping sections of the same course. The scheduling program is classified as an NP-complete problem, by which genetic algorithms were used to solve the model presented in this research. The solution to the problem was obtained using the MatLab 2015 software and an interface was designed that is easy to use by the user. The obtained results demonstrate that the developed algorithm allows to obtain a solution close to the optimal one at a reasonable time, the solution gives a good approximation to the real schedule that was used for testing.en_US
dc.language.isoesen_US
dc.subjectModelos matemáticosen_US
dc.subjectTécnica metaheurísticaen_US
dc.subject.lcshNP-complete problemsen_US
dc.subject.lcshGenetic algorithmsen_US
dc.subject.lcshMetaheuristicsen_US
dc.subject.lcshDecision making -- Mathematical modelsen_US
dc.subject.lcshSchedule, Schoolen_US
dc.titleModelo matemático para la programación de horarios, de cursos universitarios, aplicando una técnica metaheurísticaen_US
dc.typeThesisen_US
dc.rights.licenseAll rights reserveden_US
dc.rights.holder(c) 2018 José Gerardo Córdoba Hernándezen_US
dc.contributor.committeeFerrer Alameda, Mercedes S.
dc.contributor.committeeLorenzo González, Edgardo
dc.contributor.representativeMacchiavelli, Raúl E.
thesis.degree.levelM.S.en_US
thesis.degree.disciplineApplied Mathematicsen_US
dc.contributor.collegeCollege of Arts and Sciences - Sciencesen_US
dc.contributor.departmentDepartment of Mathematicsen_US
dc.description.graduationSemesterFallen_US
dc.description.graduationYear2019en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Theses & Dissertations
    Items included under this collection are theses, dissertations, and project reports submitted as a requirement for completing a degree at UPR-Mayagüez.

Show simple item record

All rights reserved
Except where otherwise noted, this item's license is described as All Rights Reserved