Topic：Variable Neighbourhood Search Metaheuristic: Recent Successful Applications
Lecturer：Professor Nenad Mladenovic,School of Information systems and Mathematics, Brunel University
Time：2010.10.29，Friday, 10:30-12:00 a.m.
Location：New Main Building A1028
Host：Professor Zhao Qiuhong
Abstract：
The basic idea of the Variable Neighbourhood Search (VNS) metaheuristic is a systematic change of neighbourhood structures within the local search algorithm. VNS proceeds by a descent method to a local minimum, then explores, systematically or at random, increasingly distant neighbourhoods of this solution. One jumps from the current solution to a new one if and only if a better solution has been found. So VNS is not a trajectory following method (as Simulated Annealing or Tabu Search) and does not specify forbidden moves. In this talk I will describe steps of several variants of VNS and try to explain theoretically why results obtained are of much better quality than those obtained by Multi-start approach.
SEM Postgraduate Association
2010-10-26
