A novel multi-agent simulation based particle swarm optimization algorithm

Recently, there has been considerable research on combining multi-agent simulation and particle swarm optimization in practice. However, most existing studies are limited to specific engineering fields or problems without summarizing a general and universal combination framework. Moreover, particle swarm optimization can be less effective in complex problems due to its weakness in balancing exploration and exploitation. Yet, it is not common to combine multi-agent simulation with improved versions of the algorithm. Therefore, this paper proposes an improved particle swarm optimization algorithm, introducing a multi-level structure and a competition mechanism to enhance exploration while balancing exploitation. The performance of the algorithm is tested by a set of comparison experiments. The results have verified its capability of converging to high-quality solutions at a fast rate while holding the swarm diversity. Further, a problem-independent simulation-optimization approach is proposed, which integrates the improved algorithm into multi-agent systems, aiming to simulate realistic scenarios dynamically and solve related optimization problems simultaneously. The approach is implemented in a response planning system to find optimal arrangements for response operations after the Sanchi oil spill accident. Results of the case study suggest that compared with the commonly-used shortest distance selection method, the proposed approach significantly shortens the overall response time, improves response efficiency, and mitigates environmental pollution.