Skip to main content

Research Repository

Advanced Search

All Outputs (5)

An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning (2022)
Journal Article
Wouda, N. A., Aslan, A., & Vis, I. F. (2023). An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning. Computers and Operations Research, 151, Article 106089. https://doi.org/10.1016/j.cor.2022.106089

Personalised learning offers an alternative method to one-size-fits-all education in schools, and has seen increasing adoption over the past several years. Personalised learning’s focus on learner-driven education requires novel scheduling methods. I... Read More about An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning.

A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems (2022)
Journal Article
Aslan, A., Ursavas, E., & Romeijnders, W. (2023). A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems. Omega, 115, Article 102779. https://doi.org/10.1016/j.omega.2022.102779

This paper studies a unique precedence constrained knapsack problem in which there are two methods available to place an item in the knapsack. Whether or not an item weight is uncertain depends on which one of the two methods is selected. This knapsa... Read More about A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems.

Optimal admission and routing with congestion-sensitive customer classes (2021)
Journal Article
Aslan, A. (2022). Optimal admission and routing with congestion-sensitive customer classes. Probability in the Engineering and Informational Sciences, 36(3), 774-798. https://doi.org/10.1017/s0269964821000073

This paper considers optimal admission and routing control in multi-class service systems in which customers can either receive quality regular service which is subject to congestion or can receive congestion-free but less desirable service at an alt... Read More about Optimal admission and routing with congestion-sensitive customer classes.

A dynamic thompson sampling hyper-heuristic framework for learning activity planning in personalized learning (2020)
Journal Article
Aslan, A., Bakir, I., & Vis, I. F. (2020). A dynamic thompson sampling hyper-heuristic framework for learning activity planning in personalized learning. European Journal of Operational Research, 286(2), 673-688. https://doi.org/10.1016/j.ejor.2020.03.038

Personalized learning is emerging in schools as an alternative to one-size-fits-all education. This study introduces and explores a weekly demand-driven flexible learning activity planning problem of own-pace own-method personalized learning. The int... Read More about A dynamic thompson sampling hyper-heuristic framework for learning activity planning in personalized learning.