Intelligent optimization algorithm based on simplex neighbourhood and multi-role evolutionary policy
An intelligent optimization algorithm, multi-role technology, applied in computing, computing models, instruments, etc., can solve problems such as poor stability, easy to fall into local optimum, large variance, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0050] Embodiment 1: See the implementation process figure 1 , figure 2 , image 3 shown. details as follows:
[0051] An objective function to be optimized is:
[0052]
[0053] It is a multimodal function containing a large number of local optimum points, and the domain is [-600,600] n , while its global optimal value is 0, and its two-dimensional distribution is as figure 2 shown. This algorithm will randomly locate the initial position of each particle with a uniform distribution within the search space set by the definition domain, and then the algorithm will guide all the particles in the group to converge to the global optimal point.
[0054] see figure 1 , the specific steps of the search algorithm are as follows:
[0055] S1), the initial random positioning of m particles in the search space based on uniform distribution;
[0056]
[0057] in, is the i-th particle in R n Searches for a position along the kth dimension of the subspace. and x k -6...
Embodiment 2
[0076] Embodiment 2: See the implementation process figure 1 , Figure 4 , Figure 5 shown. details as follows:
[0077] An objective function to be optimized is:
[0078]
[0079] It is a multimodal function containing a large number of local optimum points, and the domain of definition is: [-100, 100] n , and its global optimal point is: 0, and its two-dimensional distribution is as follows Figure 4 shown. This algorithm will randomly locate the initial position of each particle with a uniform distribution in the domain search space, and then the algorithm will guide all particles in the population to converge to the global optimal point.
[0080] see figure 1 , the specific steps of the search algorithm are as follows:
[0081] S1), the initial random positioning of m particles in the search space based on uniform distribution;
[0082]
[0083] in, is the i-th particle in R n Searches for a position along the kth dimension of the subspace. and x k Th...
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