This paper introduces several cooperative proactive S-Metaheuristics.
The proposal is based on two characteristics of agents: proactivity and cooperation.
Proactive S-Metaheuristics avoid local optima by adjusting parameters and operators.
Simple forms of cooperation are used to combine proactive metaheuristics.
The experiments consider binary problems, knapsack and travelling salesman problems.