Sciweavers

Share
HEURISTICS
2008

Bringing order into the neighborhoods: relaxation guided variable neighborhood search

8 years 4 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new Variable Neighborhood Descent (VND) algorithm. The ordering of the neighborhood structures in this VND is determined dynamically by solving relaxations of them. The objective values of these relaxations are used as indicators for the potential gains of searching the corresponding neighborhoods. We tested this new approach on the well-studied multidimensional knapsack problem. Computational experiments show that our approach is beneficial to the search, improving the obtained results. The concept is, in principle, more generally applicable and seems to be promising for many other combinatorial optimization problems approached by VNS.
Jakob Puchinger, Günther R. Raidl
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where HEURISTICS
Authors Jakob Puchinger, Günther R. Raidl
Comments (0)
books