Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Dynamic tabu list management using the reverse elimination method
Annals of Operations Research - Special issue on Tabu search
Massively parallel tabu search for the quadratic assignment problem
Annals of Operations Research - Special issue on Tabu search
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
Journal of Heuristics
A Taxonomy of Hybrid Metaheuristics
Journal of Heuristics
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Parallel tabu search for optimizing the OSPF weight setting problem
WSEAS TRANSACTIONS on COMMUNICATIONS
| Hi-index | 0.00 |
The 0 1 MultidimensionalKnapsack Problem (0 1MKP) is a NP-complete problem. Its resolution for large scale in-stances 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.