A New Algorithm to Solve the Generalized Nash Equilibrium Problem

الملخص EN

We try a new algorithm to solve the generalized Nash equilibrium problem (GNEP) in the paper.

First, the GNEP is turned into the nonlinear complementarity problem by using the Karush–Kuhn–Tucker (KKT) condition.

Then, the nonlinear complementarity problem is converted into the nonlinear equation problem by using the complementarity function method.

For the nonlinear equation equilibrium problem, we design a coevolutionary immune quantum particle swarm optimization algorithm (CIQPSO) by involving the immune memory function and the antibody density inhibition mechanism into the quantum particle swarm optimization algorithm.

Therefore, this algorithm has not only the properties of the immune particle swarm optimization algorithm, but also improves the abilities of iterative optimization and convergence speed.

With the probability density selection and quantum uncertainty principle, the convergence of the CIQPSO algorithm is analyzed.

Finally, some numerical experiment results indicate that the CIQPSO algorithm is superior to the immune particle swarm algorithm, the Newton method for normalized equilibrium, or the quasivariational inequalities penalty method.

Furthermore, this algorithm also has faster convergence and better off-line performance.