The effect of learning mechanism in Variables Neighborhood Search

Rafidah Abdul Aziz, Masri Ayob, Zalinda Othman

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

2 Citations (Scopus)

Abstract

The basic idea of the Variable Neighborhood Search (VNS) algorithm is to systematically explore the neighborhood of current solution using a set of predefined neighborhood structures. Since different problem instances have different landscape and complexity, the choice of which neighborhood structure to be applied is a challenging task. Different neighborhood structures may lead to different solution space. Therefore, this work proposes a learning mechanism in a Variable Neighborhood Search (VNS), refer to hereafter as a Variable Neighborhood Guided Search (VNGS). Its effectiveness is illustrated by solving a course timetabling problems. The learning mechanism memorizes which neighborhood structure could effectively solve a specific soft constraint violations and used it to guide the selection of neighborhood structure to enhance the quality of a best solution. The performance of the VNGS is tested over Socha course timetabling dataset. Results demonstrate that the performance of the VNGS is comparable with the results of the other VNS variants and outperformed others in some instances. This demonstrates the effectiveness of applying a learning mechanism in a VNS algorithm.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages109-113
Number of pages5
DOIs
Publication statusPublished - 2012
Event2012 4th Conference on Data Mining and Optimization, DMO 2012 - Langkawi
Duration: 2 Sep 20124 Sep 2012

Other

Other2012 4th Conference on Data Mining and Optimization, DMO 2012
CityLangkawi
Period2/9/124/9/12

Keywords

  • course timetabling
  • variable neighborhood search

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Aziz, R. A., Ayob, M., & Othman, Z. (2012). The effect of learning mechanism in Variables Neighborhood Search. In Conference on Data Mining and Optimization (pp. 109-113). [6329807] https://doi.org/10.1109/DMO.2012.6329807

The effect of learning mechanism in Variables Neighborhood Search. / Aziz, Rafidah Abdul; Ayob, Masri; Othman, Zalinda.

Conference on Data Mining and Optimization. 2012. p. 109-113 6329807.

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

Aziz, RA, Ayob, M & Othman, Z 2012, The effect of learning mechanism in Variables Neighborhood Search. in Conference on Data Mining and Optimization., 6329807, pp. 109-113, 2012 4th Conference on Data Mining and Optimization, DMO 2012, Langkawi, 2/9/12. https://doi.org/10.1109/DMO.2012.6329807
Aziz RA, Ayob M, Othman Z. The effect of learning mechanism in Variables Neighborhood Search. In Conference on Data Mining and Optimization. 2012. p. 109-113. 6329807 https://doi.org/10.1109/DMO.2012.6329807
Aziz, Rafidah Abdul ; Ayob, Masri ; Othman, Zalinda. / The effect of learning mechanism in Variables Neighborhood Search. Conference on Data Mining and Optimization. 2012. pp. 109-113
@inproceedings{1b2bb6fd366840419546ec48335e01ac,
title = "The effect of learning mechanism in Variables Neighborhood Search",
abstract = "The basic idea of the Variable Neighborhood Search (VNS) algorithm is to systematically explore the neighborhood of current solution using a set of predefined neighborhood structures. Since different problem instances have different landscape and complexity, the choice of which neighborhood structure to be applied is a challenging task. Different neighborhood structures may lead to different solution space. Therefore, this work proposes a learning mechanism in a Variable Neighborhood Search (VNS), refer to hereafter as a Variable Neighborhood Guided Search (VNGS). Its effectiveness is illustrated by solving a course timetabling problems. The learning mechanism memorizes which neighborhood structure could effectively solve a specific soft constraint violations and used it to guide the selection of neighborhood structure to enhance the quality of a best solution. The performance of the VNGS is tested over Socha course timetabling dataset. Results demonstrate that the performance of the VNGS is comparable with the results of the other VNS variants and outperformed others in some instances. This demonstrates the effectiveness of applying a learning mechanism in a VNS algorithm.",
keywords = "course timetabling, variable neighborhood search",
author = "Aziz, {Rafidah Abdul} and Masri Ayob and Zalinda Othman",
year = "2012",
doi = "10.1109/DMO.2012.6329807",
language = "English",
isbn = "9781467327183",
pages = "109--113",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - The effect of learning mechanism in Variables Neighborhood Search

AU - Aziz, Rafidah Abdul

AU - Ayob, Masri

AU - Othman, Zalinda

PY - 2012

Y1 - 2012

N2 - The basic idea of the Variable Neighborhood Search (VNS) algorithm is to systematically explore the neighborhood of current solution using a set of predefined neighborhood structures. Since different problem instances have different landscape and complexity, the choice of which neighborhood structure to be applied is a challenging task. Different neighborhood structures may lead to different solution space. Therefore, this work proposes a learning mechanism in a Variable Neighborhood Search (VNS), refer to hereafter as a Variable Neighborhood Guided Search (VNGS). Its effectiveness is illustrated by solving a course timetabling problems. The learning mechanism memorizes which neighborhood structure could effectively solve a specific soft constraint violations and used it to guide the selection of neighborhood structure to enhance the quality of a best solution. The performance of the VNGS is tested over Socha course timetabling dataset. Results demonstrate that the performance of the VNGS is comparable with the results of the other VNS variants and outperformed others in some instances. This demonstrates the effectiveness of applying a learning mechanism in a VNS algorithm.

AB - The basic idea of the Variable Neighborhood Search (VNS) algorithm is to systematically explore the neighborhood of current solution using a set of predefined neighborhood structures. Since different problem instances have different landscape and complexity, the choice of which neighborhood structure to be applied is a challenging task. Different neighborhood structures may lead to different solution space. Therefore, this work proposes a learning mechanism in a Variable Neighborhood Search (VNS), refer to hereafter as a Variable Neighborhood Guided Search (VNGS). Its effectiveness is illustrated by solving a course timetabling problems. The learning mechanism memorizes which neighborhood structure could effectively solve a specific soft constraint violations and used it to guide the selection of neighborhood structure to enhance the quality of a best solution. The performance of the VNGS is tested over Socha course timetabling dataset. Results demonstrate that the performance of the VNGS is comparable with the results of the other VNS variants and outperformed others in some instances. This demonstrates the effectiveness of applying a learning mechanism in a VNS algorithm.

KW - course timetabling

KW - variable neighborhood search

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

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

U2 - 10.1109/DMO.2012.6329807

DO - 10.1109/DMO.2012.6329807

M3 - Conference contribution

AN - SCOPUS:84869392848

SN - 9781467327183

SP - 109

EP - 113

BT - Conference on Data Mining and Optimization

ER -