An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem

Rafidah Abdul Aziz, Masri Ayob, Zalinda Othman, Zulkifli Ahmad, Nasser R. Sabar

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A standard honey-bee mating optimization algorithm (HBMO) utilizes the steepest descent local search algorithm as a worker. The steepest descent algorithm has the advantage of being simple to understand, fast and is easy to implement. However, it can easily trapped in a local optimum and subsequently restrict the performance of HBMO. Furthermore, the type of neighborhood structures that are used within the local search algorithm might impact on the performance of algorithm. This work aimed to enhance the performance of HBMO by using an adaptive guided variable neighborhood search (AGVNS) as a worker. The AGVNS algorithm is a variant of variable neighborhood search algorithm that incorporates some problem-specific knowledge and utilizes an adaptive learning mechanism to find the most suitable neighborhood structure during the searching process. In order to evaluate the effectiveness of the proposed algorithm, the Socha course timetabling dataset has been chosen as the tested domain problem. The results demonstrated that the performance of the proposed algorithm is comparable to other approaches in the literature. Indeed, the proposed algorithm obtained the best results as compared to other approaches on some instances. These results indicate the effectiveness of combining HBMO and AGVNS for solving course timetabling problems, hence demonstrated that the AGVNS can enhance the performance of HBMO.

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalSoft Computing
DOIs
Publication statusAccepted/In press - 24 Jun 2016

Fingerprint

Variable Neighborhood Search
Timetabling
Optimization Algorithm
Steepest Descent
Local Search Algorithm
Search Algorithm
Adaptive Learning
Descent Algorithm
Evaluate

Keywords

  • Adaptive guided variable neighborhood search
  • Course timetabling problem
  • Honey-bee mating optimization

ASJC Scopus subject areas

  • Software
  • Geometry and Topology
  • Theoretical Computer Science

Cite this

An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem. / Aziz, Rafidah Abdul; Ayob, Masri; Othman, Zalinda; Ahmad, Zulkifli; Sabar, Nasser R.

In: Soft Computing, 24.06.2016, p. 1-11.

Research output: Contribution to journalArticle

@article{3c3c92864bba42c7b11f31d8eb54c568,
title = "An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem",
abstract = "A standard honey-bee mating optimization algorithm (HBMO) utilizes the steepest descent local search algorithm as a worker. The steepest descent algorithm has the advantage of being simple to understand, fast and is easy to implement. However, it can easily trapped in a local optimum and subsequently restrict the performance of HBMO. Furthermore, the type of neighborhood structures that are used within the local search algorithm might impact on the performance of algorithm. This work aimed to enhance the performance of HBMO by using an adaptive guided variable neighborhood search (AGVNS) as a worker. The AGVNS algorithm is a variant of variable neighborhood search algorithm that incorporates some problem-specific knowledge and utilizes an adaptive learning mechanism to find the most suitable neighborhood structure during the searching process. In order to evaluate the effectiveness of the proposed algorithm, the Socha course timetabling dataset has been chosen as the tested domain problem. The results demonstrated that the performance of the proposed algorithm is comparable to other approaches in the literature. Indeed, the proposed algorithm obtained the best results as compared to other approaches on some instances. These results indicate the effectiveness of combining HBMO and AGVNS for solving course timetabling problems, hence demonstrated that the AGVNS can enhance the performance of HBMO.",
keywords = "Adaptive guided variable neighborhood search, Course timetabling problem, Honey-bee mating optimization",
author = "Aziz, {Rafidah Abdul} and Masri Ayob and Zalinda Othman and Zulkifli Ahmad and Sabar, {Nasser R.}",
year = "2016",
month = "6",
day = "24",
doi = "10.1007/s00500-016-2225-8",
language = "English",
pages = "1--11",
journal = "Soft Computing",
issn = "1432-7643",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem

AU - Aziz, Rafidah Abdul

AU - Ayob, Masri

AU - Othman, Zalinda

AU - Ahmad, Zulkifli

AU - Sabar, Nasser R.

PY - 2016/6/24

Y1 - 2016/6/24

N2 - A standard honey-bee mating optimization algorithm (HBMO) utilizes the steepest descent local search algorithm as a worker. The steepest descent algorithm has the advantage of being simple to understand, fast and is easy to implement. However, it can easily trapped in a local optimum and subsequently restrict the performance of HBMO. Furthermore, the type of neighborhood structures that are used within the local search algorithm might impact on the performance of algorithm. This work aimed to enhance the performance of HBMO by using an adaptive guided variable neighborhood search (AGVNS) as a worker. The AGVNS algorithm is a variant of variable neighborhood search algorithm that incorporates some problem-specific knowledge and utilizes an adaptive learning mechanism to find the most suitable neighborhood structure during the searching process. In order to evaluate the effectiveness of the proposed algorithm, the Socha course timetabling dataset has been chosen as the tested domain problem. The results demonstrated that the performance of the proposed algorithm is comparable to other approaches in the literature. Indeed, the proposed algorithm obtained the best results as compared to other approaches on some instances. These results indicate the effectiveness of combining HBMO and AGVNS for solving course timetabling problems, hence demonstrated that the AGVNS can enhance the performance of HBMO.

AB - A standard honey-bee mating optimization algorithm (HBMO) utilizes the steepest descent local search algorithm as a worker. The steepest descent algorithm has the advantage of being simple to understand, fast and is easy to implement. However, it can easily trapped in a local optimum and subsequently restrict the performance of HBMO. Furthermore, the type of neighborhood structures that are used within the local search algorithm might impact on the performance of algorithm. This work aimed to enhance the performance of HBMO by using an adaptive guided variable neighborhood search (AGVNS) as a worker. The AGVNS algorithm is a variant of variable neighborhood search algorithm that incorporates some problem-specific knowledge and utilizes an adaptive learning mechanism to find the most suitable neighborhood structure during the searching process. In order to evaluate the effectiveness of the proposed algorithm, the Socha course timetabling dataset has been chosen as the tested domain problem. The results demonstrated that the performance of the proposed algorithm is comparable to other approaches in the literature. Indeed, the proposed algorithm obtained the best results as compared to other approaches on some instances. These results indicate the effectiveness of combining HBMO and AGVNS for solving course timetabling problems, hence demonstrated that the AGVNS can enhance the performance of HBMO.

KW - Adaptive guided variable neighborhood search

KW - Course timetabling problem

KW - Honey-bee mating optimization

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

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

U2 - 10.1007/s00500-016-2225-8

DO - 10.1007/s00500-016-2225-8

M3 - Article

SP - 1

EP - 11

JO - Soft Computing

JF - Soft Computing

SN - 1432-7643

ER -