An adaptive swarm intelligence algorithm candidate solution modification method for group information sharing
A technology of swarm intelligence and group information, applied in the field of computational intelligence, can solve problems such as low search efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] This embodiment provides an adaptive group intelligence algorithm candidate solution correction method for group information sharing.
[0053] The invention is applied to the MQHOA algorithm, and the main process of MOHOA includes three main stages: energy level stability, energy level transition, and scale reduction. The invention is applied to the energy level stabilization stage.
[0054] Take function F9 in the CEC2013 test function set as an example to find its minimum value. The domain interval of this function is [-100,100], and the minimum value is -600.
[0055] The expression of function F9 is as follows:
[0056]
[0057] The MQHOA algorithm with this method is used to search for the optimal solution of F9 in 2 dimensions, and the data of the operation process is stored for analysis. Each evolution records the fitness value and marks the changes in the algorithm process. The parameter is set to K=10, σ min = 1E-06. The error when the algorithm converges is 2.16...
Embodiment 2
[0085] This embodiment provides an adaptive group intelligence algorithm candidate solution correction method for group information sharing, which specifically includes:
[0086] Suppose that x(i, j, t) represents the current position of the i-th individual of the candidate solution in the j-th dimension during the t-th iteration, x lb (i, j, t) represents the historical optimal position of the i-th individual of the candidate solution in the j-th dimension during the t-th iteration, x gb (j, t) represents the best position of all individuals in the entire population in the j-th dimension during the t-th iteration after group information sharing. σ lb (i, j, t) represents the distance between the current position of the i-th individual of the candidate solution in the j-th dimension and the historical optimal position of the individual in the tth iteration, σ gb (i, j, t) represents the distance between the current position of the i-th individual of the candidate solution in the j-...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com