16 research outputs found
Improved Squeaky Wheel Optimisation for Driver Scheduling
This paper presents a technique called Improved Squeaky Wheel Optimisation
for driver scheduling problems. It improves the original Squeaky Wheel
Optimisations effectiveness and execution speed by incorporating two additional
steps of Selection and Mutation which implement evolution within a single
solution. In the ISWO, a cycle of
Analysis-Selection-Mutation-Prioritization-Construction continues until
stopping conditions are reached. The Analysis step first computes the fitness
of a current solution to identify troublesome components. The Selection step
then discards these troublesome components probabilistically by using the
fitness measure, and the Mutation step follows to further discard a small
number of components at random. After the above steps, an input solution
becomes partial and thus the resulting partial solution needs to be repaired.
The repair is carried out by using the Prioritization step to first produce
priorities that determine an order by which the following Construction step
then schedules the remaining components. Therefore, the optimisation in the
ISWO is achieved by solution disruption, iterative improvement and an iterative
constructive repair process performed. Encouraging experimental results are
reported
Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic lists (of graph heuristics) for solving problems and investigated the heuristic lists found by employing knowledge discovery techniques. Two hybrid approaches (involving Saturation Degree and Largest Degree) including one which employs Case Based Reasoning are presented and discussed. Both the Tabu Search based hyper-heuristic and the hybrid approaches are tested on random and real-world exam timetabling problems. Experimental results are comparable with the best state-of-the-art approaches (as measured against established benchmark problems). The results also demonstrate an increased level of generality in our approach
Evolutionary Ruin And Stochastic Recreate: A Case Study On The Exam Timetabling Problem
This paper presents a new class of intelligent systems, called Evolutionary Ruin and Stochastic Recreate, that can learn and adapt to the changing enviroment. It improves the original Ruin and Recreate principle’s performance by incorporating an Evolutionary Ruin step which implements evolution within a single solution. In the proposed approach, a cycle of Solution Decomposition, Evolutionary Ruin and Stochastic Recreate continues until stopping conditions are reached. The Solution Decomposition step first uses some domain knowledge to break a solution down into its components and assign a score to each. The Evolutionary Ruin step then applies two operators (namely Selection and Mutation) to destroy a certain fraction of the entire solution. After the above steps, an input solution becomes partial and thus the resulting partial solution needs to be repaired. The repair is carried out by using the Stochastic Recreate step to reintroduce the removed items in a specific way (somewhat stochastic in order to have a better chance to jump out of the local optima), and then ask the underlying improvement heuristic whether this move will be accepted. These three steps are executed in sequence until a specific stopping condition is reached. Therefore, optimisation is achieved by solution disruption, iterative improvement and a stochastic constructive repair process performed within. Encouraging experimental results on exam timetabling problems are reported
A New Initialisation Method for Examination Timetabling Heuristics
This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Timetabling problems are widespread, but are particularly prevalent in the educational domain. When sufficiently large, these are often only effectively tackled by timetabling meta-heuristics. The effectiveness of these in turn are often largely dependant on their initialisation protocols. There are a number of different initialisation approaches used in the literature for starting examination timetabling heuristics. We present a new iterative initialisation algorithm here --- which attempts to generate high-quality and legal solutions, to feed into a heuristic optimiser. The proposed approach is empirically verified on the ITC 2007 and Yeditepe benchmark sets. It is compared to popular initialisation approaches commonly employed in exam timetabling heuristics: the largest degree, largest weighted degree, largest enrollment, and saturation degree graph-colouring approaches, and random schedule allocation. The effectiveness of these approaches are also compared via incorporation in an exemplar evolutionary algorithm. The results show that the proposed method is capable of producing feasible solutions for all instances, with better quality and diversity compared to the alternative methods. It also leads to improved optimiser performance.Saudi Arabia Cultural Burea
Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
This paper presents a state transition based formal framework for a new search method, called Evolutionary Ruin and Stochastic Recreate, which tries to learn and adapt to the changing environments during the search process. It improves the performance of the original Ruin and Recreate principle by embedding an additional phase of Evolutionary Ruin to mimic the survival-of-the-fittest mechanism within single solutions. This method executes a cycle of Solution Decomposition, Evolutionary Ruin, Stochastic Recreate and Solution Acceptance until a certain stopping condition is met. The Solution Decomposition phase first uses some problem-specific knowledge to decompose a complete solution into its components and assigns a score to each component. The Evolutionary Ruin phase then employs two evolutionary operators (namely Selection and Mutation) to destroy a certain fraction of the solution, and the next Stochastic Recreate phase repairs the “broken” solution. Last, the Solution Acceptance phase selects a specific strategy to determine the probability of accepting the newly generated solution. Hence, optimisation is achieved by an iterative process of component evaluation, solution disruption and stochastic constructive repair. From the state transitions point of view, this paper presents a probabilistic model and implements a Markov chain analysis on some theoretical properties of the approach. Unlike the theoretical work on genetic algorithm and simulated annealing which are based on state transitions within the space of complete assignments, our model is based on state transitions within the space of partial assignments. The exam timetabling problems are used to test the performance in solving real-world hard problems
DEVELOPMENT OF A MODIFIED PARTICLE SWARM OPTIMIZATION BASED CULTURAL ALGORITHM FOR SOLVING UNIVERSITY TIMETABLING PROBLEM
Timetabling problems are search problems in which courses must be arranged around a set of timeslots so that some constraints are satisfied. However, slow convergence speed and high computational complexity are one of drawbacks limiting the efficiency of the existing timetabling algorithms. In this paper, a Modified Particle Swarm Optimization based Cultural Algorithm which is characterized with low computational complexity and high convergence speed was developed for solving university lecture timetabling problems. The standard Particle Swarm Optimization (PSO) algorithm was modified by introducing influence factors and acceleration component in order to improve the converge speed of the algorithm. Cultural algorithm was formulated by incorporating the Modified Particle Swarm Optimization (MPSO) into its population space. Thus, the developed Modified Particle Swarm Optimization based Cultural Algorithm could be implemented and employed for solving lecture timetabling problems in higher institutions
Polynomial reduction of time–space scheduling to time scheduling
AbstractWe study the University Course Timetabling Problem (UCTP). In particular we deal with the following question: is it possible to decompose UCTP into two problems, namely, (i) a time scheduling, and (ii) a space scheduling. We have arguments that it is not possible. Therefore we study UCTP with the assumption that each room belongs to exactly one type of room. A type of room is a set of rooms, which have similar properties. We prove that in this case UCTP is polynomially reducible to time scheduling. Hence we solve UCTP with the following method: at first we solve time scheduling and subsequently we solve space scheduling with a polynomial O(n3) algorithm. In this way we obtain a radical (exponential) speed-up of algorithms for UCTP. The method was applied at P.J. Šafárik University