Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"School timetabling problem"”.
-
Mathematical investigation of a model of the school timetabling problem
The task of constructing school timetables - which is a laborious one - seems an obvious problem for a computer. The early attempts to solve this problem were simply of a ‘trial and error' type and did not depend upon any mathematical theory. However, it soon became evident that the problem could …
-
A matheuristic approach for solving the high school timetabling problem
The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of time, satisfying requirements of different types. Given the combinatorial …
-
An integer programming formulation for the music school timetabling problem
Before every semester, music schools in Iceland face the challenge of creating timetables for students and teachers registered at the school. Many music schools create their timetables manually, which is very time consuming. In this thesis a model will be presented that is intended to solve the …
-
Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing
… instituições de ensino se deparam com um típico problema: montar as grades horárias das turmas, segundo as demandas de aulas de suas disciplinas e considerando as restrições de disponibilidade horária de todos os envolvidos. Conhecido na literatura como School Timetabling Problem (STP), este …
-
New models and algorithms for the timetables of Italian high schools
The thesis investigates new timetabling problems, which are motivated by the com- plex case of Italian schools. Generally speaking, the High School Timetabling Problem is aimed at giving the right order to the meetings between groups of students and teachers. However, it requires to pre-assign …
-
Uma abordagem metaheurística para o problema de alocação de horário escolar no IFRN
… as well as various other constraints, the high school timetabling problem has long been studied by the academic community. In this context, (meta)heuristic approaches have been the method-of-choice when finding high-quality solutions in a feasible timespan. This work proposes a greedy randomized …
-
Επίλυση προβλημάτων κατασκευής βέλτιστου ωρολογίου προγράμματος (timetabling) και σχεδιασμού δικτύων μεταφορών (transit routing) με χρήση σύγχρονων αλγορίθμων υπολογιστικής νοημοσύνης και ευφυών υβριδικών συστημάτων
… presents the research carried out in solving the problems of constructing optimal timetables (timetabling) that are used, mainly, in the field of Greek Secondary Education and transport network planning (transit routing), using modern Computational Intelligence Algorithms and Hybrid Intelligent …
-
Σχεδίαση, ανάπτυξη και εφαρμογή αλγορίθμων υπολογιστικής νοημοσύνης σε προβλήματα εύρεσης βέλτιστου ωρολογίου προγράμματος σε σχολεία δευτεροβάθμιας εκπαίδευσης (school timetabling) και χρονοπρογραμματισμού (scheduling)
… and implementation of algorithms forsolving the school timetabling problem in a feasible and efficient way. In particular,focus is given in the well-known Particle Swarm Optimization (PSO) algorithm, whichis modified so as to fit the specific aspects of the problem’s discrete space, while …
-
Modeling the Homeschool timetabling problem using Integer programming
Home schooling has steadily been increasing in the past decade. According to a survey in 2007, about 2.5 million children were being home schooled in the US. Typically, parents provide education at the convenience of their home and in some cases an instructor is appointed for the same. The Home …
-
Models and Algorithms for School Timetabling
In constraint programming, combinatorial problems are specified declaratively in terms of constraints. Constraints are relations over problem variables that define the space of solutions by specifying restrictions on the values that variables may take simultaneously. To solve problems stated in …