A hybrid simulated annealing with solutions memory for curriculum-based course timetabling problem

L. Y. Tarawneh, Masri Ayob, Zulkifli Ahmad

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

This study proposes a hybrid Simulated Annealing with solutions memory (SAM) to solve university course timetable problems. Simulated Annealing (SA) is one of the popular meta-heuristic algorithms for solving combinatorial optimization problems. However, SA could get trapped in local optimum, especially when the temperature becomes very low. In order to escape from this local optimum, this hybrid work tried to jump to another promising region using not accepted solutions saved in the memory. The computational results tested on ITC 2007 course timetabling benchmark dataseis showed that SAM, can consistently produce good quality solutions, which are comparable to other approaches tested on ITC 2007 datasets.

Original languageEnglish
Pages (from-to)262-269
Number of pages8
JournalJournal of Applied Sciences
Volume13
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Simulated annealing
Curricula
Data storage equipment
Combinatorial optimization
Heuristic algorithms
Temperature

Keywords

  • Course timetabling problem
  • Educational timetabling
  • Heuristic
  • Memory strategy
  • Optimization
  • Scheduling
  • Simulated annealing

ASJC Scopus subject areas

  • General

Cite this

A hybrid simulated annealing with solutions memory for curriculum-based course timetabling problem. / Tarawneh, L. Y.; Ayob, Masri; Ahmad, Zulkifli.

In: Journal of Applied Sciences, Vol. 13, No. 2, 2013, p. 262-269.

Research output: Contribution to journalArticle

@article{6bc2974efb2d4682a716adb0f99a7ea0,
title = "A hybrid simulated annealing with solutions memory for curriculum-based course timetabling problem",
abstract = "This study proposes a hybrid Simulated Annealing with solutions memory (SAM) to solve university course timetable problems. Simulated Annealing (SA) is one of the popular meta-heuristic algorithms for solving combinatorial optimization problems. However, SA could get trapped in local optimum, especially when the temperature becomes very low. In order to escape from this local optimum, this hybrid work tried to jump to another promising region using not accepted solutions saved in the memory. The computational results tested on ITC 2007 course timetabling benchmark dataseis showed that SAM, can consistently produce good quality solutions, which are comparable to other approaches tested on ITC 2007 datasets.",
keywords = "Course timetabling problem, Educational timetabling, Heuristic, Memory strategy, Optimization, Scheduling, Simulated annealing",
author = "Tarawneh, {L. Y.} and Masri Ayob and Zulkifli Ahmad",
year = "2013",
doi = "10.3923/jas.2013.262.269",
language = "English",
volume = "13",
pages = "262--269",
journal = "Journal of Applied Sciences",
issn = "1812-5654",
publisher = "Asian Network for Scientific Information",
number = "2",

}

TY - JOUR

T1 - A hybrid simulated annealing with solutions memory for curriculum-based course timetabling problem

AU - Tarawneh, L. Y.

AU - Ayob, Masri

AU - Ahmad, Zulkifli

PY - 2013

Y1 - 2013

N2 - This study proposes a hybrid Simulated Annealing with solutions memory (SAM) to solve university course timetable problems. Simulated Annealing (SA) is one of the popular meta-heuristic algorithms for solving combinatorial optimization problems. However, SA could get trapped in local optimum, especially when the temperature becomes very low. In order to escape from this local optimum, this hybrid work tried to jump to another promising region using not accepted solutions saved in the memory. The computational results tested on ITC 2007 course timetabling benchmark dataseis showed that SAM, can consistently produce good quality solutions, which are comparable to other approaches tested on ITC 2007 datasets.

AB - This study proposes a hybrid Simulated Annealing with solutions memory (SAM) to solve university course timetable problems. Simulated Annealing (SA) is one of the popular meta-heuristic algorithms for solving combinatorial optimization problems. However, SA could get trapped in local optimum, especially when the temperature becomes very low. In order to escape from this local optimum, this hybrid work tried to jump to another promising region using not accepted solutions saved in the memory. The computational results tested on ITC 2007 course timetabling benchmark dataseis showed that SAM, can consistently produce good quality solutions, which are comparable to other approaches tested on ITC 2007 datasets.

KW - Course timetabling problem

KW - Educational timetabling

KW - Heuristic

KW - Memory strategy

KW - Optimization

KW - Scheduling

KW - Simulated annealing

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

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

U2 - 10.3923/jas.2013.262.269

DO - 10.3923/jas.2013.262.269

M3 - Article

AN - SCOPUS:84874311727

VL - 13

SP - 262

EP - 269

JO - Journal of Applied Sciences

JF - Journal of Applied Sciences

SN - 1812-5654

IS - 2

ER -