Incorporating tabu search into memetic approach for enrolment-based course timetabling problems

Hamza Turabieh, Salwani Abdullah

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

20 Citations (Scopus)

Abstract

This work presents a tabu search and a memetic approach to an enrolment based course timetabling problem called Tabu-based memetic algorithm, the proposed approach employed crossover and mutation operators to a selected solution from the population. Then applying neighborhood structure randomly which is not in tabu-list to enhance the quality of the solution. The tabu list is used to penalize neighborhood structures that are unable to generate better solutions. We demonstrate that our approach is able to produce good quality solutions due to the ability to select more promising neighborhood structures.

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages115-119
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 2nd Conference on Data Mining and Optimization, DMO 2009 - Bangi, Selangor
Duration: 27 Oct 200928 Oct 2009

Other

Other2009 2nd Conference on Data Mining and Optimization, DMO 2009
CityBangi, Selangor
Period27/10/0928/10/09

Fingerprint

Tabu search

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Turabieh, H., & Abdullah, S. (2009). Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 115-119). [5341901] https://doi.org/10.1109/DMO.2009.5341901

Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. / Turabieh, Hamza; Abdullah, Salwani.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 115-119 5341901.

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

Turabieh, H & Abdullah, S 2009, Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341901, pp. 115-119, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341901
Turabieh H, Abdullah S. Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 115-119. 5341901 https://doi.org/10.1109/DMO.2009.5341901
Turabieh, Hamza ; Abdullah, Salwani. / Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 115-119
@inproceedings{8bff4d32b9e045708639656256c60bfa,
title = "Incorporating tabu search into memetic approach for enrolment-based course timetabling problems",
abstract = "This work presents a tabu search and a memetic approach to an enrolment based course timetabling problem called Tabu-based memetic algorithm, the proposed approach employed crossover and mutation operators to a selected solution from the population. Then applying neighborhood structure randomly which is not in tabu-list to enhance the quality of the solution. The tabu list is used to penalize neighborhood structures that are unable to generate better solutions. We demonstrate that our approach is able to produce good quality solutions due to the ability to select more promising neighborhood structures.",
author = "Hamza Turabieh and Salwani Abdullah",
year = "2009",
doi = "10.1109/DMO.2009.5341901",
language = "English",
isbn = "9781424449446",
pages = "115--119",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Incorporating tabu search into memetic approach for enrolment-based course timetabling problems

AU - Turabieh, Hamza

AU - Abdullah, Salwani

PY - 2009

Y1 - 2009

N2 - This work presents a tabu search and a memetic approach to an enrolment based course timetabling problem called Tabu-based memetic algorithm, the proposed approach employed crossover and mutation operators to a selected solution from the population. Then applying neighborhood structure randomly which is not in tabu-list to enhance the quality of the solution. The tabu list is used to penalize neighborhood structures that are unable to generate better solutions. We demonstrate that our approach is able to produce good quality solutions due to the ability to select more promising neighborhood structures.

AB - This work presents a tabu search and a memetic approach to an enrolment based course timetabling problem called Tabu-based memetic algorithm, the proposed approach employed crossover and mutation operators to a selected solution from the population. Then applying neighborhood structure randomly which is not in tabu-list to enhance the quality of the solution. The tabu list is used to penalize neighborhood structures that are unable to generate better solutions. We demonstrate that our approach is able to produce good quality solutions due to the ability to select more promising neighborhood structures.

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

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

U2 - 10.1109/DMO.2009.5341901

DO - 10.1109/DMO.2009.5341901

M3 - Conference contribution

AN - SCOPUS:72449146742

SN - 9781424449446

SP - 115

EP - 119

BT - 2009 2nd Conference on Data Mining and Optimization, DMO 2009

ER -