Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)

Hassan Younis Al-Tarawneh, Masri Ayob

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

3 Citations (Scopus)

Abstract

In this work we apply a Tabu search and multi-neighborhood structure to solve University Course Timetable at the faculty of engineering, University Kebangsan Malaysia. The aim is to introduce the neighborhood structure according to the difference between the lengths of lectures (i.e. some lectures are one hour, while others are two hours). Therefore, the new neighborhood structure is required to handle this problem. The results have demonstrate the effectiveness of the proposed neighborhood structure.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages208-212
Number of pages5
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

Tabu search

Keywords

  • multi-neighborhood structure
  • Tabu search
  • University course timetabling

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering). / Al-Tarawneh, Hassan Younis; Ayob, Masri.

Conference on Data Mining and Optimization. 2011. p. 208-212 5976529.

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

Al-Tarawneh, HY & Ayob, M 2011, Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering). in Conference on Data Mining and Optimization., 5976529, pp. 208-212, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976529
@inproceedings{6975710eea4e41b286954e2c3bf309dd,
title = "Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)",
abstract = "In this work we apply a Tabu search and multi-neighborhood structure to solve University Course Timetable at the faculty of engineering, University Kebangsan Malaysia. The aim is to introduce the neighborhood structure according to the difference between the lengths of lectures (i.e. some lectures are one hour, while others are two hours). Therefore, the new neighborhood structure is required to handle this problem. The results have demonstrate the effectiveness of the proposed neighborhood structure.",
keywords = "multi-neighborhood structure, Tabu search, University course timetabling",
author = "Al-Tarawneh, {Hassan Younis} and Masri Ayob",
year = "2011",
doi = "10.1109/DMO.2011.5976529",
language = "English",
isbn = "9781612842127",
pages = "208--212",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)

AU - Al-Tarawneh, Hassan Younis

AU - Ayob, Masri

PY - 2011

Y1 - 2011

N2 - In this work we apply a Tabu search and multi-neighborhood structure to solve University Course Timetable at the faculty of engineering, University Kebangsan Malaysia. The aim is to introduce the neighborhood structure according to the difference between the lengths of lectures (i.e. some lectures are one hour, while others are two hours). Therefore, the new neighborhood structure is required to handle this problem. The results have demonstrate the effectiveness of the proposed neighborhood structure.

AB - In this work we apply a Tabu search and multi-neighborhood structure to solve University Course Timetable at the faculty of engineering, University Kebangsan Malaysia. The aim is to introduce the neighborhood structure according to the difference between the lengths of lectures (i.e. some lectures are one hour, while others are two hours). Therefore, the new neighborhood structure is required to handle this problem. The results have demonstrate the effectiveness of the proposed neighborhood structure.

KW - multi-neighborhood structure

KW - Tabu search

KW - University course timetabling

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

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

U2 - 10.1109/DMO.2011.5976529

DO - 10.1109/DMO.2011.5976529

M3 - Conference contribution

AN - SCOPUS:80055028002

SN - 9781612842127

SP - 208

EP - 212

BT - Conference on Data Mining and Optimization

ER -