Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling

Li, Jingpeng, Bai, Ruibin, Shen, Yindong and Qu, Rong (2014) Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling. European Journal of Operational Research, 242 (3). pp. 798-806. ISSN 0377-2217

Full text not available from this repository.


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.

Item Type: Article
Additional Information: NOTICE: this is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, vol. 242, issue 3, 2015. DOI:
Keywords: Metaheuristics, Evolutionary algorithm, stochastic process, combinatorial optimisation, exam timetabling
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number:
Depositing User: Qu, Rong
Date Deposited: 26 Feb 2015 16:37
Last Modified: 04 May 2020 16:57

Actions (Archive Staff Only)

Edit View Edit View