Constraint directed variable neighbourhood search

A. Andrew, J. Levine, D. Long

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

Abstract

Local search algorithms operate by making small changes to candidate solutions with the aim of reaching new and improved solutions. The problem is that often the search will become trapped at sub optimal states from where there are no improving neighbours. Much research has gone into creating schemes to avoid these local optima and various strategies exist mainly based around altering the acceptance function. Another approach is Variable Neighbourhood Search which aims to bypass optima by linearly switching through multiple search neighbourhoods. We propose a new method where the selection of neighbourhoods is dynamically decided dependant on the violations of the problem constraints, Constraint Directed Variable Neighbourhood Search. We compared Constraint Directed Variable Neighbourhood Search to Variable
Neighbourhood Search and show that the same search progress can be
achieved whilst exploring only a fraction of the states.
Original languageEnglish
Title of host publicationProceedings of the 4th International Workshop on Local Search Techniques in Constraint Satisfaction held at CP 2007
Number of pages12
Publication statusPublished - 1 Sept 2007

Keywords

  • neighbourhood search
  • local search
  • directed variables
  • local search algorithms

Fingerprint

Dive into the research topics of 'Constraint directed variable neighbourhood search'. Together they form a unique fingerprint.

Cite this