Bringing order into the neighborhoods: relaxation guided variable neighborhood search

Authors:
Jakob Puchinger;Günther R. Raidl
Affiliations:
NICTA Victoria Research Laboratory, The University of Melbourne, Victoria, Australia 3010;Institute of Computer Graphics and Algorithms (E186), Vienna University of Technology, Vienna, Austria 1040
Venue:
Journal of Heuristics
Year:
2008

Citing 6
Cited 1

A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Combinations of local search and exact algorithms

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
The core concept for the multidimensional knapsack problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

On neighborhood tree search

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

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.