Adaptive Guided Variable neighborhood search

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The basic idea of a Variable Neighborhood Search (VNS) algorithm is to systematically explore a neighborhood of a solution using a set of predefined neighborhood structures. Since different problem instances have different landscapes and complexities whilst different neighborhood structures may lead to different solution spaces, the choice of which neighborhood structure to be applied is a challenging task. Therefore, this work proposes an Adaptive Guided Variables Neighborhood Search (AG-VNS). AG-VNS has two phases. First, is a learning phase which is used to memorize neighborhood structures that can effectively solve specific soft constraint violations by applying the neighborhood structures to the best solution. These steps are repeated until a stopping condition for the learning phase is met. Second, is an improvement phase which is used to enhance the quality of a current best solution by selecting the most suitable neighborhood structure from memory that will be applied to the current solution. Its effectiveness is illustrated by solving course time tabling problems. The performance of the AG-VNS is tested over the Socha course time tabling datasets. Results demonstrated that the performance of the AG-VNS is comparable with the results of the other VNS variants, while outperforming some variants in particular instances. This demonstrates the effectiveness of applying the adaptive learning mechanism to guide the selection of the neighborhood structures in the VNS algorithm.

Original languageEnglish
Pages (from-to)883-888
Number of pages6
JournalJournal of Applied Sciences
Volume13
Issue number6
DOIs
Publication statusPublished - 2013

Fingerprint

Data storage equipment

Keywords

  • Adaptive search
  • Course time tabling
  • Variable neighborhood search

ASJC Scopus subject areas

  • General

Cite this

Adaptive Guided Variable neighborhood search. / Aziz, Rafidah Abdul; Ayob, Masri; Othman, Zalinda; Mohd Sarim, Hafiz.

In: Journal of Applied Sciences, Vol. 13, No. 6, 2013, p. 883-888.

Research output: Contribution to journalArticle

@article{ac6abebccebf4d6ea6a5e07ce179bb02,
title = "Adaptive Guided Variable neighborhood search",
abstract = "The basic idea of a Variable Neighborhood Search (VNS) algorithm is to systematically explore a neighborhood of a solution using a set of predefined neighborhood structures. Since different problem instances have different landscapes and complexities whilst different neighborhood structures may lead to different solution spaces, the choice of which neighborhood structure to be applied is a challenging task. Therefore, this work proposes an Adaptive Guided Variables Neighborhood Search (AG-VNS). AG-VNS has two phases. First, is a learning phase which is used to memorize neighborhood structures that can effectively solve specific soft constraint violations by applying the neighborhood structures to the best solution. These steps are repeated until a stopping condition for the learning phase is met. Second, is an improvement phase which is used to enhance the quality of a current best solution by selecting the most suitable neighborhood structure from memory that will be applied to the current solution. Its effectiveness is illustrated by solving course time tabling problems. The performance of the AG-VNS is tested over the Socha course time tabling datasets. Results demonstrated that the performance of the AG-VNS is comparable with the results of the other VNS variants, while outperforming some variants in particular instances. This demonstrates the effectiveness of applying the adaptive learning mechanism to guide the selection of the neighborhood structures in the VNS algorithm.",
keywords = "Adaptive search, Course time tabling, Variable neighborhood search",
author = "Aziz, {Rafidah Abdul} and Masri Ayob and Zalinda Othman and {Mohd Sarim}, Hafiz",
year = "2013",
doi = "10.3923/jas.2013.883.888",
language = "English",
volume = "13",
pages = "883--888",
journal = "Journal of Applied Sciences",
issn = "1812-5654",
publisher = "Asian Network for Scientific Information",
number = "6",

}

TY - JOUR

T1 - Adaptive Guided Variable neighborhood search

AU - Aziz, Rafidah Abdul

AU - Ayob, Masri

AU - Othman, Zalinda

AU - Mohd Sarim, Hafiz

PY - 2013

Y1 - 2013

N2 - The basic idea of a Variable Neighborhood Search (VNS) algorithm is to systematically explore a neighborhood of a solution using a set of predefined neighborhood structures. Since different problem instances have different landscapes and complexities whilst different neighborhood structures may lead to different solution spaces, the choice of which neighborhood structure to be applied is a challenging task. Therefore, this work proposes an Adaptive Guided Variables Neighborhood Search (AG-VNS). AG-VNS has two phases. First, is a learning phase which is used to memorize neighborhood structures that can effectively solve specific soft constraint violations by applying the neighborhood structures to the best solution. These steps are repeated until a stopping condition for the learning phase is met. Second, is an improvement phase which is used to enhance the quality of a current best solution by selecting the most suitable neighborhood structure from memory that will be applied to the current solution. Its effectiveness is illustrated by solving course time tabling problems. The performance of the AG-VNS is tested over the Socha course time tabling datasets. Results demonstrated that the performance of the AG-VNS is comparable with the results of the other VNS variants, while outperforming some variants in particular instances. This demonstrates the effectiveness of applying the adaptive learning mechanism to guide the selection of the neighborhood structures in the VNS algorithm.

AB - The basic idea of a Variable Neighborhood Search (VNS) algorithm is to systematically explore a neighborhood of a solution using a set of predefined neighborhood structures. Since different problem instances have different landscapes and complexities whilst different neighborhood structures may lead to different solution spaces, the choice of which neighborhood structure to be applied is a challenging task. Therefore, this work proposes an Adaptive Guided Variables Neighborhood Search (AG-VNS). AG-VNS has two phases. First, is a learning phase which is used to memorize neighborhood structures that can effectively solve specific soft constraint violations by applying the neighborhood structures to the best solution. These steps are repeated until a stopping condition for the learning phase is met. Second, is an improvement phase which is used to enhance the quality of a current best solution by selecting the most suitable neighborhood structure from memory that will be applied to the current solution. Its effectiveness is illustrated by solving course time tabling problems. The performance of the AG-VNS is tested over the Socha course time tabling datasets. Results demonstrated that the performance of the AG-VNS is comparable with the results of the other VNS variants, while outperforming some variants in particular instances. This demonstrates the effectiveness of applying the adaptive learning mechanism to guide the selection of the neighborhood structures in the VNS algorithm.

KW - Adaptive search

KW - Course time tabling

KW - Variable neighborhood search

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

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

U2 - 10.3923/jas.2013.883.888

DO - 10.3923/jas.2013.883.888

M3 - Article

AN - SCOPUS:84880165480

VL - 13

SP - 883

EP - 888

JO - Journal of Applied Sciences

JF - Journal of Applied Sciences

SN - 1812-5654

IS - 6

ER -