A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem

The 0 1 MultidimensionalKnapsack 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 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.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Smaïl Niar, Arnaud Fréville
• Keywords: Distributed And Parallel Computing, IPPS 1997, Parallel Search Processes, Prohibitive Processing Time, Search Processes