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

S. Niar, A. Freville
Proceedings 11th International Parallel Processing Symposium  
The 0 1 Multidimensional Knapsack Problem (0 1 MKP) is a 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
more » ... iven 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.
doi:10.1109/ipps.1997.580948 dblp:conf/ipps/NiarF97 fatcat:anms7tl6ongcjdqdqnkyk24mgq