Papers
Topics
Authors
Recent
Search
2000 character limit reached

Globally Coupled Particle Swarm Optimization

Published 29 Aug 2025 in math.OC | (2508.21721v1)

Abstract: All things in the world are interconnected, the only difference is the strength of their connections.Particle swarm optimization(PSO) simulates the foraging behavior of a flock of birds, information is transmitted to quickly find the location of food. This is a process of information exchange, where birds influence each other, constantly adjusting their position and speed values,and updating the optimal position information.In this paper, we propose a globally coupled particle swarm ptimization(GCPSO) that combines the globally coupled map lattices(GCML) with the PSO to enhance its optimization capabilities.The information of the $i$-th lattice point is influenced by the information of all lattice points in GCML.The information between lattice points is interdependent.Inspired by this, we will integrate GCML into PSO and propose a new improved particle swarm optimization, namely GCPSO.Here, the speed update formula has been modified and improved.The next flight speed of each bird is influenced by its current speed, its historical best position, the historical global best position, its current position, and the positions of all birds.Each bird(particle) is influenced by all birds. The strength of the impact will be distinguished by the size of the weight. This is the essential difference and key improvement from PSO.Through extensive experiments, it has been found that compared to PSO, GCPSO has a stronger ability to search for solutions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.