An efficient tabu search approach for the 0–1 multidimensional knapsack problem

An efficient tabu search approach for the 0–1 multidimensional knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor19992525
Country: Netherlands
Volume: 106
Issue: 2/3
Start Page Number: 659
End Page Number: 675
Publication Date: Apr 1998
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: integer
Abstract:

In this paper, we describe a new approach to tabu search based on strategic oscillation and surrogate constraint information that provides a balance between intensification and diversification strategies. New rules needed to control the oscillation process are given for the 0–1 multidimensional knapsack. Based on a portfolio of test problems from the literature, our method obtains solutions whose quality is at least as good as the best solutions obtained by previous methods, especially with large scale instances. These encouraging results confirm the efficiency of the tunneling concept coupled with surrogate information when resource constraints are present.

Reviews

Required fields are marked *. Your email address will not be published.