Abstract
Without mutation and crossover operators, Particle Optimization Algorithm (PSO) is more liable to converge on a local minimum than genetic algorithm. Therefore, a distributed PSO based on multi agent system is proposed to overcome this shortcoming by importing mutation operators in genetic algorithm. In the evolution process, the agent swarms with different mutation operators run independently. Client agent swarms inform their individuals with highest fitness to the host agent swarm so as to replace its worst after certain generations of evolution. Therefore, the whole particle swarm enjoys a higher probability of finding the global optimum. Numerical results show the proposed method can find better solutions than other methods. Distributive in nature, it can run concurrently on many platforms scattered over local area network and even Internet for large-scale combinatorial combination problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
