Heuristic tools for optimal assignment of class schedules
Keywords:
Ant colony system, Metaheuristics, Optimization techniquesAbstract
This paper proposes a methodology to solve theproblem of proper allocation of classrooms. Amethodology is based on heuristics techniques aswell as the use of the metaheuristic Ant ColonyOptimization. To achieve this goal, it is initially describedthe problem. Thus, the mathematical modelis developed in order to ensure that each scheduledevent is assigned to an adequate classroom.Additionally, the attendance timing of the studentsenrolled to each event is determined. The computationaleffort of the proposed algorithm is testedusing known instances in the literature. Finally, wepropose future work to improve the results achievedin this work and visualize himself viability ofthe implementation of the methodology in the LibreUniversity of Pereira.
Downloads
References
2. International Timetabling Competition. Disponibleen página de internet: http://www.idsia.ch/Files/ttcomp2002/
3. Burke, E.K.; Elliman, D.G.; Ford, P.;Weare,R.F.; Examination timetabling in British Universities– A survey. In: Burke and Ross, pp.76–92, 1996.
4. Carter, M.W.; Laporte, G.; Recent developmentsin practical examination timetabling. In:Burke and Ross, pp. 3–21, 1996.
5. Carter, M.W.; Laporte, G.; Recent developmentsin practical course timetabling. In: Burkeand Carter, pp. 3–19, 1996.
6. Werra; An introduction to timetabling. EuropeanJournal of Operational Research, 19, pp.151–162, 1985.
7. White, G.M.; and Chan P.W.; Towards theconstruction of optimal examination timetables.INFOR 17, pp. 219–229, 1979.
8. Fisher, J.G.; Shier, D.R.; A heuristic procedurefor large-scale examination scheduling problems.Technical Report 417, Department ofMathematical Sciences, Clemson University.
9. White G.M.; Constrained satisfaction, not soconstrained satisfaction and the timetablingproblem. In: A Plenary Talk in the Proceedingsof the 3rd International Conference onthe Practice and Theory of Automated Timetabling,University of Applied Sciences, Konstanz,August 16–18, 2000, pp. 32–47.
10. Burke, E.K.; Newall, J.P.; Weare, R.F.; 1996b.A memetic algorithm for University exam timetabling.In: Burke and Ross, pp. 241–250,1996.
11. Domingo M.;Stützle T.; Ant Colony Optimization,A Bradford Book, Massachusetts Instituteof Technology, 2004.
12. Granada M.; Toro E.M.; Franco J.F.; Programaciónóptima de horarios de clase usando unalgoritmo memético. Scientia et technical AñoXII no. 30 Mayo de 2006.
13. Burke; McCollum; Meisels; A graph-basedhyper-heuristic for educational timetablingproblems. European Journal of OperationalResearch 176, 2007.
