A parallel Tabu search algorithm for the 0-1 multidimensional knapsack problem

Author(s):  
S. Niar ◽  
A. Freville
2012 ◽  
Vol 3 (4) ◽  
pp. 43-63 ◽  
Author(s):  
Mahdi Khemakhem ◽  
Boukthir Haddar ◽  
Khalil Chebil ◽  
Saïd Hanafi

This paper proposes a new hybrid tree search algorithm to the Multidimensional Knapsack Problem (MKP) that effectively combines tabu search with a dynamic and adaptive neighborhood search procedure. The authors’ heuristic, based on a filter-and-fan (F&F) procedure, uses a Linear Programming-based Heuristic to generate a starting solution to the F&F process. A tabu search procedure is used to try to enhance the best solution value provided by the F&F method that generates compound moves by a strategically truncated form of tree search. They report the first application of the F&F method to the MKP. Experimental results obtained on a wide set of benchmark problems clearly demonstrate the competitiveness of the proposed method compared to the state-of-the-art heuristic methods.


2013 ◽  
Vol 65 (3) ◽  
pp. 466-474 ◽  
Author(s):  
Wojciech Bożejko ◽  
Jarosław Pempera ◽  
Czesław Smutnicki

2016 ◽  
Vol 40 (23-24) ◽  
pp. 9788-9805 ◽  
Author(s):  
Jianjun Liu ◽  
Changzhi Wu ◽  
Jiang Cao ◽  
Xiangyu Wang ◽  
Kok Lay Teo

Sign in / Sign up

Export Citation Format

Share Document