Improve Particle Swarm Optimization and Differential Evolution Algorithms Using Nash Bargaining Theory

<span style="font-size: 10.0pt; line-height: 125%; font-family: 'Georgia',serif; mso-ascii-theme-font: minor-latin; mso-fareast-font-family: Georgia; mso-fareast-theme-font: minor-latin; mso-hansi-theme-font: minor-latin; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: minor-bidi; mso-ansi-language: EN-US; mso-fareast-language: JA; mso-bidi-language: AR-SA;">&nbsp;</span><span style="font-size: 11pt; line-height: 125%; font-family: Calibri, sans-serif;">This article proposes a new approach in solving optimization (issues) problems in which two known optimization algorithm of particle swarm algorithm (PSO) and differential evolution (DE) a cooperate. The proposed approach uses a coalition or cooperation model in the game theory to improve the DE and PSO algorithms. This is done in an attempt to keep a balance between the exploration and exploitation capabilities by preventing population stagnation and avoiding the local optimum. The DE and PSO algorithms are two players in the state space, which play cooperative games together using the Nash bargaining theory to find the best solution. To evaluate the performance of the proposed algorithm, 25 benchmark functions are used in terms of the CEC2005 structure. The proposed algorithm is then compared with the classical DE and PSO algorithms and the hybrid algorithms recently proposed. The results indicated that the proposed hybrid algorithm outperformed the classical algorithms and other hybrid models.</span>