El problema de horarios y cursos basados en currículum
Descargas
La descarga de datos todavía no está disponible.
Citas
N. Pillay, R. Qu, “Hyper-Heuristics: Theory and Applications”, Springer, Natural Computing Series, 2018.
K. Smith-Miles, L. Lopes, “Measuring instance difficulty for combinatorial optimization problems”, Computers & Operations Research, vol. 39, pp. 875–889, 2012.
C. K. Teoh, A. Wibowo, M. S. Ngadiman, “Review of state of the art for metaheuristic techniques in Academic Scheduling Problems”, Artificial Intelligence Review, vol. 44, pp. 1–21, 2015.
Competencia Internacional de Horarios, problema de horarios 2007 y cursos basados en curr´ıculum, http://www.cs.qub.ac.uk/itc2007/curriculmcourse/course curriculm index files/problemmodel.html
V. Kralev, R. Kraleva, “A local search algorithm based on chromatic classes for university course timetabling problem”, International Journal of Advanced Computer Research, Vol 7, 2016.
M. Alzaqebah, S. Abdullah, “Hybrid bee colony optimization for examination timetabling problems”, Computers & Operations Research, vol. 54, pp. 142–154, 2015.
N. Pillay, E. Ozcan, “Automated gene- ¨ ration of constructive ordering heuristics for educational timetabling”, Annals of Operations Research, vol. 275, pp. 181–208,
2019.
N. C. F. Bagger, M. Sørensen, T.R. Stidsen, “Benders’ decomposition for curriculum-based course timetabling”,Computers and Operations Research, vol. 91, pp. 178–189, 2018.
M. Lindahl, A. J. Mason, T. Stidsen, M. Sørensen, “A strategic view of University timetabling”, European Journal of Operational Research, vol. 266, pp. 35–45, 2018.
T. Chong Keat, H. Haron, A. Wibowo, M. S. Ngadiman, “A Heuristic Room Matching Algorithm in Generating Enhanced Initial Seed for the UniversityCourse Timetabling Problem”, Research Journal of Applied Sciences, Engineering and Technology, vol. 10, pp. 882-889, 2015.
H. Babaei, J. Karimpour, A. Hadidi, “A survey of approaches for university course timetabling problem”, Computers & Industrial Engineering, Vol. 86, pp 43-59,2015.
S. Kirkpatrick, C. D. Gelatt, M. P.Vecchi, “Optimization by simulated annealing”, Science, vol. 220, issue 4598, pp. 671-680, 1983.
I. Boussa¨ıd, J. Lepagnot, P. Siarry, “A survey on optimization metaheuristics”, Information Sciences, vol. 237, pp. 82–117, 2013.
T. Song, S. Liu, X. Tang, X. Peng, M. Chem, “An iterated local search algorithm for the University Course Timetabling Problem”, Applied Soft Computing, Volume 68, pp. 597-608, 2018.
M. Kalender, A. Kheiri, E. Ozcan, E. ¨ K. Burke, “A greedy gradient-simulated annealing selection hyper-heuristic”, SoftComputing, vol. 17, pp. 2279–2292, 2013.
G. Dueck, “New optimization heuristics: the great deluge algorithm and the record-to-record travel”, Journal of Computational Physics. Vol. 104, pp. 86–92,1993.
C. Weng Fong, H. Asmuni, B. McCollum, P. McMullan, S. Omatu, “A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems”, Information Sciences vol. 283, pp. 1–21, 2014.
L. Araujo, C. Cervig´on, “Algoritmo evolutivos: un enfoque pr´actico”, RA-MA, M´exico, 2009.
J. B. Matias, A. C. Fajardo, R. M. Medina, “Examining Genetic Algorithm with Guided Search and Self-Adaptive Neighborhood Strategies for Curriculum-Based Course Timetable Problem”, IEEE, Fourth International Conference on Advances in Computing, Comunication & Automation (ICACCA), pp. 1-6, 2019.
S. Sivanandam, & S. Deepa, “Introduction to Genetic Algorithms”, Springer., 2008.
N. R. Sabar, M. Ayob, G. Kendall, R.Qu, “A Dynamic Multiarmed Bandit-Gene Expression Programming Hyper-Heuristic for Combinatorial OptimizationProblems”, European Journal of Operational Research, IEEE Transactions on Cybernetics, Volumen 45, N´umero 2, pp. 217-228, 2015.
N. R. Sabar, M. Ayob, G. Kendall, R. Qu, “Automatic Design of a Hyper-Heuristic Framework With Gene Expression Programming for Combinatorial Optimization Problems”, IEEE Transactions on Evolutionary Computation, Volumen 19, N´umero. 3, pp. 309-325, 2015.
E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, R. Qu, “Hy- ¨ per heuristics: a survey of the state of the art”, Journal of the Operational Research Society, vol. 64, pp. 1695–1724, 2013.
K. Smith-Miles, L. Lopes, “Measuring instance difficulty for combinatorial optimization problems”, Computers & Operations Research, vol. 39, pp. 875–889, 2012.
C. K. Teoh, A. Wibowo, M. S. Ngadiman, “Review of state of the art for metaheuristic techniques in Academic Scheduling Problems”, Artificial Intelligence Review, vol. 44, pp. 1–21, 2015.
Competencia Internacional de Horarios, problema de horarios 2007 y cursos basados en curr´ıculum, http://www.cs.qub.ac.uk/itc2007/curriculmcourse/course curriculm index files/problemmodel.html
V. Kralev, R. Kraleva, “A local search algorithm based on chromatic classes for university course timetabling problem”, International Journal of Advanced Computer Research, Vol 7, 2016.
M. Alzaqebah, S. Abdullah, “Hybrid bee colony optimization for examination timetabling problems”, Computers & Operations Research, vol. 54, pp. 142–154, 2015.
N. Pillay, E. Ozcan, “Automated gene- ¨ ration of constructive ordering heuristics for educational timetabling”, Annals of Operations Research, vol. 275, pp. 181–208,
2019.
N. C. F. Bagger, M. Sørensen, T.R. Stidsen, “Benders’ decomposition for curriculum-based course timetabling”,Computers and Operations Research, vol. 91, pp. 178–189, 2018.
M. Lindahl, A. J. Mason, T. Stidsen, M. Sørensen, “A strategic view of University timetabling”, European Journal of Operational Research, vol. 266, pp. 35–45, 2018.
T. Chong Keat, H. Haron, A. Wibowo, M. S. Ngadiman, “A Heuristic Room Matching Algorithm in Generating Enhanced Initial Seed for the UniversityCourse Timetabling Problem”, Research Journal of Applied Sciences, Engineering and Technology, vol. 10, pp. 882-889, 2015.
H. Babaei, J. Karimpour, A. Hadidi, “A survey of approaches for university course timetabling problem”, Computers & Industrial Engineering, Vol. 86, pp 43-59,2015.
S. Kirkpatrick, C. D. Gelatt, M. P.Vecchi, “Optimization by simulated annealing”, Science, vol. 220, issue 4598, pp. 671-680, 1983.
I. Boussa¨ıd, J. Lepagnot, P. Siarry, “A survey on optimization metaheuristics”, Information Sciences, vol. 237, pp. 82–117, 2013.
T. Song, S. Liu, X. Tang, X. Peng, M. Chem, “An iterated local search algorithm for the University Course Timetabling Problem”, Applied Soft Computing, Volume 68, pp. 597-608, 2018.
M. Kalender, A. Kheiri, E. Ozcan, E. ¨ K. Burke, “A greedy gradient-simulated annealing selection hyper-heuristic”, SoftComputing, vol. 17, pp. 2279–2292, 2013.
G. Dueck, “New optimization heuristics: the great deluge algorithm and the record-to-record travel”, Journal of Computational Physics. Vol. 104, pp. 86–92,1993.
C. Weng Fong, H. Asmuni, B. McCollum, P. McMullan, S. Omatu, “A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems”, Information Sciences vol. 283, pp. 1–21, 2014.
L. Araujo, C. Cervig´on, “Algoritmo evolutivos: un enfoque pr´actico”, RA-MA, M´exico, 2009.
J. B. Matias, A. C. Fajardo, R. M. Medina, “Examining Genetic Algorithm with Guided Search and Self-Adaptive Neighborhood Strategies for Curriculum-Based Course Timetable Problem”, IEEE, Fourth International Conference on Advances in Computing, Comunication & Automation (ICACCA), pp. 1-6, 2019.
S. Sivanandam, & S. Deepa, “Introduction to Genetic Algorithms”, Springer., 2008.
N. R. Sabar, M. Ayob, G. Kendall, R.Qu, “A Dynamic Multiarmed Bandit-Gene Expression Programming Hyper-Heuristic for Combinatorial OptimizationProblems”, European Journal of Operational Research, IEEE Transactions on Cybernetics, Volumen 45, N´umero 2, pp. 217-228, 2015.
N. R. Sabar, M. Ayob, G. Kendall, R. Qu, “Automatic Design of a Hyper-Heuristic Framework With Gene Expression Programming for Combinatorial Optimization Problems”, IEEE Transactions on Evolutionary Computation, Volumen 19, N´umero. 3, pp. 309-325, 2015.
E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, R. Qu, “Hy- ¨ per heuristics: a survey of the state of the art”, Journal of the Operational Research Society, vol. 64, pp. 1695–1724, 2013.
Publicado
2021-03-18
Cómo citar
González González, J. C. G. G., & Martínez Licona, A. E. (2021). El problema de horarios y cursos basados en currículum. Contactos, Revista De Educación En Ciencias E Ingeniería, (119), 65-71. Recuperado a partir de https://contactos.izt.uam.mx/index.php/contactos/article/view/104
Sección
Artículos
