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

The 0-1 multidimensional knapsack problem (0-1 MKP) is an NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we propose a new parallel meta-heuristic algorithm based on the Tabu search (TS) for the resolution of the 0-1 MKP. We show that, in addition to reducing execution time, parallel processing can perform automatically and dynamically the settings of some TS parameters. This last point is realized by analyzing the information given by cooperative parallel search processes, and by modifying the search processes during the execution. This approach introduces a new level where balancing between intensification and diversification can be realized.

[1]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  R. Battiti,et al.  Local search with memory: benchmarking RTS , 1995 .

[4]  Stefan Voß,et al.  Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..

[5]  Fred Glover,et al.  Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .

[6]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[7]  Michel Gendreau,et al.  TOWARDS A TAXONOMY OF PARALLEL TABU SEARCH ALGORITHMS. , 1993 .

[8]  Teodor Gabriel Crainic,et al.  Communication Issues in Designing Cooperative Multi-Thread Parallel Searches , 1996 .

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[10]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[11]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[12]  Pamela H. Vance,et al.  Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth) , 1993, SIAM Rev..

[13]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[14]  Jadranka Skorin-Kapov,et al.  Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..

[15]  Saïd Hanafi,et al.  An efficient tabu search approach for the 0-1 multidimensional knapsack problem , 1998, Eur. J. Oper. Res..