نتایج جستجو برای: university course timetabling problem ucttp
تعداد نتایج: 1482676 فیلتر نتایج به سال:
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimization problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve ...
Examination timetabling is a type of educational timetabling which is a highly challenging field for the researchers and practitioners. Examination timetabling problems require a search for the best assignment of examinations into a fixed number of time-slots possibly along with other resources, such as, a set of rooms with certain capacities, subject to a set of constraints. There are two comm...
Examination timetabling is a well-studied combinatorial optimization problem. We present a new hybrid algorithm for examination timetabling, consisting of three phases: a constraint programming phase to develop an initial solution, a simulated annealing phase to improve the quality of solution, and a hill climbing phase for further improvement. The examination timetabling problem at the Univers...
The course timetabling problem is one of the most difficult combinatorial problems, it requires the assignment of a fixed number of subjects into a number of time slots minimizing the number of student conflicts. This article presents a comparison between state-of-the-art hyper-heuristics and a newly proposed iterated variable neighborhood descent algorithm when solving the course timetabling p...
University timetabling is an issue that has received more attention in the field of operations research. Course scheduling process arranging time slots and room for a class by paying to existing limitations. This problem NP-Hard problem, which means computation find solution increases exponentially with size problem. Solutions problems this kind generally use heuristic approach, tries sufficien...
In this paper we present a solution for the routing problem related to university course timetabling. We propose a heuristic algorithm that reduces the total distance travelled by each group of student between the different buildings occupying classrooms. This heuristic was tested using real data from the faculty of economic and management sciences of Sfax in Tunisia. The obtained results have ...
One of the peculiarities of university timetabling problems lies in their huge complexity and the easy transition between complex constrained system to an over-constrained one. The Faculty of Informat-ics timetabling problem represents very complex scheduling and resource allocation problem as individual timetable for every student has to be scheduled with respect to course pre-enrollment infor...
Although university course timetabling is a widely studied topic, the use of automated timetabling systems is not widespread among large universities. This is particularly true in the United States, where the state of the art is typically to roll forward the last like semester’s timetable and make adjustments to room assignments. University timetabling is a hard problem because of its size and ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید