Group competition type group global search algorithm
The invention relates to the technical field of group intelligent computing, in particular to a group competition type group global search algorithm, which is expressed as large probability determination of an optimal objective function. Randomly generating n group particles in the feature space of...
Saved in:
Main Authors | , , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
15.09.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The invention relates to the technical field of group intelligent computing, in particular to a group competition type group global search algorithm, which is expressed as large probability determination of an optimal objective function. Randomly generating n group particles in the feature space of the target function, and obtaining a related target function value; generating m individual particles around each group particle in the feature space based on the initial position of the group particle and the initial limit stride of the team, and updating the position and the limit stride of the group particle by comparing the group particle with the corresponding individual particle and comparing the group particles; through continuous interaction, calculation updating and iteration between individual particles and group particles and between group particles, the optimal group particle is more and more approximate to the optimal solution of the objective function. When the optimal solution of the target function |
---|---|
Bibliography: | Application Number: CN202310688383 |