The Strategic Random Search (SRS) algorithm

The Strategic Random Search (SRS) is a new global optimization algorithm to solve unconstrained single-objective optimization problems.

Ahora está siguiendo esta publicación

The Strategic Random Search (SRS) algorithm is a new global optimization algorithm to solve unconstrained single-objective optimization problems.
Contains a total of 3 programs ("SRS.m", "Example.m" and "Compare.m") and 1 dataset ("DataPE.mat"):
(1) "SRS.m" is the main program of the SRS algorithm, and the specific parameters of the algorithm are given.
(2) "Example.m" gives an example of the use of the SRS algorithm for reference.
(3) "Compare.m" compares the convergence of the four algorithms (SRS, SCE-UA, GA, PSO) in a specific situation on the hydrological model GR4J, and gives the calling methods of the four algorithms and the differences in the results.
(4) "DataPE.mat" is the supporting data set of "Compare.m".

Citar como

Haoshan Wei (2026). The Strategic Random Search (SRS) algorithm (https://es.mathworks.com/matlabcentral/fileexchange/101373-the-strategic-random-search-srs-algorithm), MATLAB Central File Exchange. Recuperado .

Agradecimientos

Inspirado por: Shuffled Complex Evolution (SCE-UA) Method

Información general

Compatibilidad con la versión de MATLAB

  • Compatible con cualquier versión

Compatibilidad con las plataformas

  • Windows
  • macOS
  • Linux
Versión Publicado Notas de la versión Action
1.0.3

The annotations of the algorithm are slightly modified.

1.0.2

The annotations of the algorithm are slightly modified.

1.0.1

Modified the description of the algorithm

1.0.0