VNS ExplorerSE 600 · Part 2 · Lecture 12 · Variable Neighborhood Search — for self-study after class

Method
Problem

About this method

Flow of the method

The orange box is the step that just happened. The small numbers count how often each box has been visited.

Cost landscape

iteration0
k–
VND neighbourhood
current f(x)–
best–
evaluations0
current solution x after shake x′ after local search x″ best so far neighbours being searched

Click anywhere on the curve to choose the starting solution. The bands under the curve are N1 ⊂ N2 ⊂ N3 …: how far k random moves can reach from x.

Press Step to begin.

The k-cycle

Filled marker = the candidate was better, so k resets to 1. Hollow = no improvement, so k moves up one level.

Cost over the run

current f(x)best so farafter shake

Step log

Compare all three

Runs BVNS, VND and GVNS on this problem with the same seed and settings, then shows the best cost each one reached.