Multi Objective Particle Swarm Optimization based Cooperative Agents with Automated Negotiation

TL;DR

This paper introduces a hybrid multi-objective particle swarm optimization method with cooperative agents and automated negotiation to enhance search diversity and avoid local optima in complex optimization problems.

Contribution

It proposes a novel hybrid approach combining MOPSO with cooperative agents and automated negotiation, dynamically adjusting sub-populations for improved search performance.

Findings

Enhanced diversity in search space

Better balance between exploration and exploitation

Outperforms comparative algorithms on benchmarks

Abstract

This paper investigates a new hybridization of multi-objective particle swarm optimization (MOPSO) and cooperative agents (MOPSO-CA) to handle the problem of stagnation encounters in MOPSO, which leads solutions to trap in local optima. The proposed approach involves a new distribution strategy based on the idea of having a set of a sub-population, each of which is processed by one agent. The number of the sub-population and agents are adjusted dynamically through the Pareto ranking. This method allocates a dynamic number of sub-population as required to improve diversity in the search space. Additionally, agents are used for better management for the exploitation within a sub-population, and for exploration among sub-populations. Furthermore, we investigate the automated negotiation within agents in order to share the best knowledge. To validate our approach, several benchmarks are performed. The results show that the introduced variant ensures the trade-off between the exploitation and exploration with respect to the comparative algorithms