Skip to Main content Skip to Navigation
Journal articles

Bringing order into the neighborhoods: relaxation guided variable neighborhood search

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Jakob Puchinger Connect in order to contact the contributor
Submitted on : Monday, November 9, 2015 - 1:17:54 PM
Last modification on : Thursday, October 14, 2021 - 3:02:12 AM
Long-term archiving on: : Wednesday, February 10, 2016 - 10:10:19 AM


Files produced by the author(s)




Jakob Puchinger, Günther Raidl. Bringing order into the neighborhoods: relaxation guided variable neighborhood search. Journal of Heuristics, Springer Verlag, 2008, 14 (5), pp.457-472. ⟨10.1007/s10732-007-9048-9⟩. ⟨hal-01224918⟩



Les métriques sont temporairement indisponibles