Scatter search for solving the course timetabling problem

Ghaith M. Jaradat, Masri Ayob

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Scatter Search (SS) is an evolutionary population-based metaheuristic that has been successfully applied to hard combinatorial optimization problems. In contrast to the genetic algorithm, it reduces the population of solutions size into a promising set of solutions in terms of quality and diversity to maintain a balance between diversification and intensification of the search. Also it avoids using random sampling mechanisms such as crossover and mutation in generating new solutions. Instead, it performs a crossover in the form of structured solution combinations based on two good quality and diverse solutions. In this study, we propose a SS approach for solving the course timetabling problem. The approach focuses on two main methods employed within it; the reference set update and solution combination methods. Both methods provide a deterministic search process by maintaining diversity of the population. This is achieved by manipulating a dynamic population size and performing a probabilistic selection procedure in order to generate a promising reference set (elite solutions). It is also interesting to incorporate an Iterated Local Search routine into the SS method to increase the exploitation of generated good quality solutions effectively to escape from local optima and to decrease the computational time. Experimental results showed that our SS approach produces good quality solutions, and outperforms some results reported in the literature (regarding Socha's instances) including population-based algorithms.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages213-218
Number of pages6
DOIs
Publication statusPublished - 2011
Event2011 3rd Conference on Data Mining and Optimization, DMO 2011 - Putrajaya
Duration: 28 Jun 201129 Jun 2011

Other

Other2011 3rd Conference on Data Mining and Optimization, DMO 2011
CityPutrajaya
Period28/6/1129/6/11

Fingerprint

Population dynamics
Combinatorial optimization
Genetic algorithms
Sampling

Keywords

  • course timetabling problem
  • reference set
  • Scatter Search
  • solution combination

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Jaradat, G. M., & Ayob, M. (2011). Scatter search for solving the course timetabling problem. In Conference on Data Mining and Optimization (pp. 213-218). [5976530] https://doi.org/10.1109/DMO.2011.5976530

Scatter search for solving the course timetabling problem. / Jaradat, Ghaith M.; Ayob, Masri.

Conference on Data Mining and Optimization. 2011. p. 213-218 5976530.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jaradat, GM & Ayob, M 2011, Scatter search for solving the course timetabling problem. in Conference on Data Mining and Optimization., 5976530, pp. 213-218, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976530
Jaradat GM, Ayob M. Scatter search for solving the course timetabling problem. In Conference on Data Mining and Optimization. 2011. p. 213-218. 5976530 https://doi.org/10.1109/DMO.2011.5976530
Jaradat, Ghaith M. ; Ayob, Masri. / Scatter search for solving the course timetabling problem. Conference on Data Mining and Optimization. 2011. pp. 213-218
@inproceedings{ea00d495df3444c580a888a5b5a491e2,
title = "Scatter search for solving the course timetabling problem",
abstract = "Scatter Search (SS) is an evolutionary population-based metaheuristic that has been successfully applied to hard combinatorial optimization problems. In contrast to the genetic algorithm, it reduces the population of solutions size into a promising set of solutions in terms of quality and diversity to maintain a balance between diversification and intensification of the search. Also it avoids using random sampling mechanisms such as crossover and mutation in generating new solutions. Instead, it performs a crossover in the form of structured solution combinations based on two good quality and diverse solutions. In this study, we propose a SS approach for solving the course timetabling problem. The approach focuses on two main methods employed within it; the reference set update and solution combination methods. Both methods provide a deterministic search process by maintaining diversity of the population. This is achieved by manipulating a dynamic population size and performing a probabilistic selection procedure in order to generate a promising reference set (elite solutions). It is also interesting to incorporate an Iterated Local Search routine into the SS method to increase the exploitation of generated good quality solutions effectively to escape from local optima and to decrease the computational time. Experimental results showed that our SS approach produces good quality solutions, and outperforms some results reported in the literature (regarding Socha's instances) including population-based algorithms.",
keywords = "course timetabling problem, reference set, Scatter Search, solution combination",
author = "Jaradat, {Ghaith M.} and Masri Ayob",
year = "2011",
doi = "10.1109/DMO.2011.5976530",
language = "English",
isbn = "9781612842127",
pages = "213--218",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - Scatter search for solving the course timetabling problem

AU - Jaradat, Ghaith M.

AU - Ayob, Masri

PY - 2011

Y1 - 2011

N2 - Scatter Search (SS) is an evolutionary population-based metaheuristic that has been successfully applied to hard combinatorial optimization problems. In contrast to the genetic algorithm, it reduces the population of solutions size into a promising set of solutions in terms of quality and diversity to maintain a balance between diversification and intensification of the search. Also it avoids using random sampling mechanisms such as crossover and mutation in generating new solutions. Instead, it performs a crossover in the form of structured solution combinations based on two good quality and diverse solutions. In this study, we propose a SS approach for solving the course timetabling problem. The approach focuses on two main methods employed within it; the reference set update and solution combination methods. Both methods provide a deterministic search process by maintaining diversity of the population. This is achieved by manipulating a dynamic population size and performing a probabilistic selection procedure in order to generate a promising reference set (elite solutions). It is also interesting to incorporate an Iterated Local Search routine into the SS method to increase the exploitation of generated good quality solutions effectively to escape from local optima and to decrease the computational time. Experimental results showed that our SS approach produces good quality solutions, and outperforms some results reported in the literature (regarding Socha's instances) including population-based algorithms.

AB - Scatter Search (SS) is an evolutionary population-based metaheuristic that has been successfully applied to hard combinatorial optimization problems. In contrast to the genetic algorithm, it reduces the population of solutions size into a promising set of solutions in terms of quality and diversity to maintain a balance between diversification and intensification of the search. Also it avoids using random sampling mechanisms such as crossover and mutation in generating new solutions. Instead, it performs a crossover in the form of structured solution combinations based on two good quality and diverse solutions. In this study, we propose a SS approach for solving the course timetabling problem. The approach focuses on two main methods employed within it; the reference set update and solution combination methods. Both methods provide a deterministic search process by maintaining diversity of the population. This is achieved by manipulating a dynamic population size and performing a probabilistic selection procedure in order to generate a promising reference set (elite solutions). It is also interesting to incorporate an Iterated Local Search routine into the SS method to increase the exploitation of generated good quality solutions effectively to escape from local optima and to decrease the computational time. Experimental results showed that our SS approach produces good quality solutions, and outperforms some results reported in the literature (regarding Socha's instances) including population-based algorithms.

KW - course timetabling problem

KW - reference set

KW - Scatter Search

KW - solution combination

UR - http://www.scopus.com/inward/record.url?scp=80055063203&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80055063203&partnerID=8YFLogxK

U2 - 10.1109/DMO.2011.5976530

DO - 10.1109/DMO.2011.5976530

M3 - Conference contribution

AN - SCOPUS:80055063203

SN - 9781612842127

SP - 213

EP - 218

BT - Conference on Data Mining and Optimization

ER -