Abstract

In large-scale optimization problems, the PSO algorithm based on population information interaction performs well. However, the algorithm typically only uses population information for updating, neglecting potentially useful information during evolution. Furthermore, the pressure of computing resources and complex evolution processes pose challenges to search and balancing strategy. In this paper, an agent-assisted heterogeneous learning swarm optimizer is proposed. First, a global and local search collaborative particle learning structure is proposed, called a heterogeneous learning structure. The population distribution in the decision and objective spaces are used to select global and local search examples, respectively. Secondly, an agent-assisted evolutionary search is proposed, which evaluates the individual’s state in decision space and objective space and controls the global and local search structures to adapt to the evolutionary requirements of individuals in different evolutionary states. Finally, hierarchical resource allocation and level-based global search example selection mechanisms are proposed on the local and global search structures to maintain the balance between diversity and convergence. To evaluate the performance of the proposed algorithm, comprehensive and extensive experiments were conducted on a commonly used large-scale benchmark suite. Experiments show that compared with ten state-of-the-art large-scale optimization algorithms, the proposed algorithm demonstrates superior performance in most cases.

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 call

Disclaimer: 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.