427 research outputs found
The Optimum Combination Of Local Searches For Genetic Operators In Memetic Algorithm For The Space Allocation Problem [QA9.58. S624 2008 f rb].
Dalam tesis ini, kami membuat penyelidikan mengenai pengagihan ruang di universiti. Kajian ini memfokus kepada pengagihan ruang dalam penyediaan jadual waktu.
This thesis investigates the university space allocation problem, which focuses on the distribution of events among the available venues, without violating any hard constraints
while satisfying as many soft constraints as possible and ensure optimum space utilization
Operational Research in Education
Operational Research (OR) techniques have been applied, from the early stages of the discipline, to a wide variety of issues in education. At the government level, these include questions of what resources should be allocated to education as a whole and how these should be divided amongst the individual sectors of education and the institutions within the sectors. Another pertinent issue concerns the efficient operation of institutions, how to measure it, and whether resource allocation can be used to incentivise efficiency savings. Local governments, as well as being concerned with issues of resource allocation, may also need to make decisions regarding, for example, the creation and location of new institutions or closure of existing ones, as well as the day-to-day logistics of getting pupils to schools. Issues of concern for managers within schools and colleges include allocating the budgets, scheduling lessons and the assignment of students to courses. This survey provides an overview of the diverse problems faced by government, managers and consumers of education, and the OR techniques which have typically been applied in an effort to improve operations and provide solutions
A time predefined variable depth search for nurse rostering
This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as the next potential link in the chain. Because end users vary in how long they are willing to wait for solutions, a particular goal of this research was to create an algorithm that accepts a user specified computational time limit and uses it effectively. When compared against previously published approaches the results show that the algorithm is very competitive
Course Time Table Scheduling for a Local College
This study dive into the field of course time table scheduling for a local institution. The subject of the study will be a local college in Malaysia, in particular on the SEGi College branch in Penang. This covers the development of the prototype software which will enable the simulation of the course time table for both the students and lecturers. The prototype software will be on a local search approach with reference to Hill Climbing with Random Walk algorithm and Best First Search algorithm. This research enables users to increase efficiency and performance in developing a course time table. Later,this research will be proposed for implementation to the management of SEGi College branch in Penang
Some Experiences with Hybrid Genetic Algorithms in Solving the Uncapacitated Examination Timetabling Problem
This paper provides experimental experiences on two local search hybridized
genetic algorithms in solving the uncapacitated examination timetabling
problem. The proposed two hybrid algorithms use partition and priority based
solution representations which are inspired from successful genetic algorithms
proposed for graph coloring and project scheduling problems, respectively. The
algorithms use a parametrized saturation degree heuristic hybridized crossover
scheme. In the experiments, the algorithms firstly are calibrated with a Design
of Experiments approach and then tested on the well-known Toronto benchmark
instances. The calibration shows that the hybridization prefers an intensive
local search method. The experiments indicate the vitality of local search in
the proposed genetic algorithms, however, experiments also show that the
hybridization benefits local search as well. Interestingly, although the
structures of the two algorithms are not alike, their performances are quite
similar to each other and also to other state-of-the-art genetic-type
algorithms proposed in the literature
An evolutionary non-Linear great deluge approach for solving course timetabling problems
The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variation of memetic algorithms. The popularity of evolutionary computation approaches has increased and become an important technique in solving complex combinatorial optimisation problems. The proposed approach is an extension of a non-linear great deluge algorithm in which evolutionary operators are incorporated. First, we generate a population of feasible solutions using a tailored process that incorporates heuristics for graph colouring and assignment problems. The initialisation process is capable of producing feasible solutions even for large and most constrained problem instances. Then, the population of feasible timetables is subject to a steady-state evolutionary process that combines mutation and stochastic local search. We conducted experiments to evaluate the performance of the proposed algorithm and in particular, the contribution of the evolutionary operators. The results showed the effectiveness of the hybridisation between non-linear great deluge and evolutionary operators in solving university course timetabling problems
- …