نتایج جستجو برای: university courses timetabling
تعداد نتایج: 479110 فیلتر نتایج به سال:
Today, University Timetabling problems are occurred annually and they are often hard and time consuming to solve. This paper describes Hyper Heuristics (HH) method based on Great Deluge (GD) and its variants for solving large, highly constrained timetabling problems from different domains. Generally, in hyper heuristic framework, there are two main stages: heuristic selection and move acceptanc...
the world wide web becomes very popular recently and plays an influential role in english learning. by burgeoning role of source-based writing as partial fulfillment of tefl courses and vast use of the internet, lack of empirical studies to explore these areas is obvious. this study aimed to explore the effect of the amount of familiarity with the web (internet literacy) on junior english stude...
Timetabling problems are often solved based upon what is assumed to be complete information about the problem. However, users may later desire modifications to the generated timetable to adapt to changing requirements or increase their personal satisfaction with the solution [1,5,3]. Methods that allow corrections to an existing timetable while leaving most of the solution intact are necessary....
The International Timetabling Competition 2019 (ITC 2019) posed a university timetabling problem involving assigning classes to times and rooms for an entire semester while students required classes. We propose new mixed integer programming (MIP) formulation of the problem. MIP takes advantage different graph structures in conflict graphs construct strong constraints. In addition, we introduce ...
This work arises from the research of the Metaheuristics Network on the University Course Timetabling Problem. In a first phase straightforward implementations of different metaheuristics were compared on a common local search framework [4]. In a second phase problem specific knoweldge was exploited and several alternatives for local search and metaheuristics were considered. Many possibilities...
Arranging a lecture/tutorial/lab timetable in a large university department or school is a hard problem faced continually in educational establishments. We describe how this problem has been solved in one institution via the use of evolutionary algorithms. The technique extends easily and straightforwardly to any lecture timetabling problem. Although there may be more eeective ways to handle pa...
Timetabling problems emerge in many variations [9], depending on the nature of the assignments involved (exam timetabling, course timetabling, school timetabling and others), as well as, the characteristics of the institution and the set of constraints assumed. In this communication we focus on a particular school timetabling problem the Class/Teacher Timetabling Problem (CTTP) that will be des...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید