This paper makes a deeper study of a multi-thread based cooperative strategy, previously proposed by us, to solve combinatorial optimization problems. In this strategy, each thread stands for a different optimization algorithm (or the same one with different settings) and they are all controlled by a
. Both, the
threads and the
thread have been modeled by soft computing techniques. We evaluate the performance of the strategy according to the number of threads using instances of the knapsack problem.